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 listJul 5, 2026 21:03Victor MerckléVictor MerckléScore: 5,584Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 5, 2026 21:055,55554,245,69544,988,0001,121,0002,117,632stderr
2Jul 5, 2026 21:055,56354,250,79745,068,0001,112,0002,117,632stderr
3Jul 5, 2026 21:055,57054,132,31945,118,0001,114,0002,117,632stderr
4Jul 5, 2026 21:055,57654,360,67645,167,0001,121,0002,117,632stderr
5Jul 5, 2026 21:055,58454,431,61845,163,0001,187,0002,117,632stderr
6Jul 5, 2026 21:055,58554,460,49745,241,0001,119,0002,117,632stderr
7Jul 5, 2026 21:055,59054,497,07645,391,0001,010,0002,117,632stderr
8Jul 5, 2026 21:055,59754,543,64445,448,0001,009,0002,117,632stderr
9Jul 5, 2026 21:055,60554,622,63945,335,0001,193,0002,117,632stderr