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 listMar 4, 2026 07:18DanielDanielScore: 52,795Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 4, 2026 07:1852,725469,773,794435,623,0001,998,0002,363,392
2Mar 4, 2026 07:1852,738464,236,164435,725,0001,998,0002,289,664
3Mar 4, 2026 07:1852,743464,267,896435,773,0001,998,0002,293,760
4Mar 4, 2026 07:1852,765460,063,617435,953,0001,999,0002,293,760
5Mar 4, 2026 07:1852,795467,394,092437,200,0001,000,0002,293,760
6Mar 4, 2026 07:1852,849462,682,363436,645,0001,998,0002,293,760
7Mar 4, 2026 07:1852,854467,891,505436,693,0001,998,0002,367,488
8Mar 4, 2026 07:1852,855465,086,717437,697,000999,0002,293,760
9Mar 4, 2026 07:1852,927466,389,995439,292,00002,359,296