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 19:40Victor MerckléVictor MerckléScore: 3,739Success
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 19:433,65838,643,63329,221,0001,145,0002,117,632stderr
2Sep 8, 2026 19:433,69438,995,01829,632,0001,035,0002,117,632stderr
3Sep 8, 2026 19:433,70239,035,24729,640,0001,092,0002,117,632stderr
4Sep 8, 2026 19:433,71639,130,41329,733,0001,112,0002,117,632stderr
5Sep 8, 2026 19:433,73940,777,58129,929,0001,106,0002,117,632stderr
6Sep 8, 2026 19:433,74040,274,05329,949,0001,096,0002,117,632stderr
7Sep 8, 2026 19:433,74140,267,96229,927,0001,130,0002,117,632stderr
8Sep 8, 2026 19:433,74239,340,71529,943,0001,120,0002,117,632stderr
9Sep 8, 2026 19:433,74239,404,85829,942,0001,117,0002,117,632stderr