Parse integers Sergey Svistunov

Compute the sum of integers read from STDIN as fast as possible.

Input: 50 000 000 lines, each containing one integer in the range [0; 2147483647].

629871117
2024562523
1372689083
1021777120
2111176472

Output: The uint64 sum of all numbers, printed as a decimal string.

Note: Integer overflow is expected – use a 64-bit accumulator.

Back to listJan 3, 2026 02:59Josu San MartinJosu San MartinScore: 5,723Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 3, 2026 02:595,38073,212,17243,636,0001,014,0002,363,392
2Jan 3, 2026 02:595,47270,853,89444,412,0001,009,0002,289,664
3Jan 3, 2026 02:595,52678,272,60643,872,0001,994,0002,363,392
4Jan 3, 2026 02:595,61575,020,66946,608,00002,293,760
5Jan 3, 2026 02:595,67770,009,33545,112,0002,005,0002,293,760
6Jan 3, 2026 02:595,71969,993,73646,456,0001,009,0002,281,472
7Jan 3, 2026 02:595,72368,712,81246,489,0001,010,0002,293,760
8Jan 3, 2026 02:595,72976,651,55846,543,0001,011,0002,289,664
9Jan 3, 2026 02:595,74173,705,10046,634,0001,013,0002,293,760
10Jan 3, 2026 02:595,80669,645,83847,186,0001,003,0002,367,488
11Jan 3, 2026 02:595,89276,339,61746,906,0001,996,0002,379,776
12Jan 3, 2026 02:595,99976,943,17047,798,0001,991,0002,285,568