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 listSep 8, 2026 18:51Victor MerckléVictor MerckléScore: 3,722Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 8, 2026 18:533,62338,622,72329,056,0001,023,0002,142,208stderr
2Sep 8, 2026 18:533,63738,737,78729,016,0001,174,0002,142,208stderr
3Sep 8, 2026 18:533,65638,887,98129,291,0001,054,0002,142,208stderr
4Sep 8, 2026 18:533,67539,070,54229,454,0001,053,0002,142,208stderr
5Sep 8, 2026 18:533,72239,412,31429,856,0001,038,0002,142,208stderr
6Sep 8, 2026 18:533,72339,707,01329,857,0001,044,0002,142,208stderr
7Sep 8, 2026 18:533,72340,307,61829,882,0001,023,0002,142,208stderr
8Sep 8, 2026 18:533,73639,561,49229,958,0001,052,0002,142,208stderr
9Sep 8, 2026 18:533,74739,638,03029,885,0001,218,0002,142,208stderr