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 9, 2026 17:55Victor MerckléVictor MerckléScore: 4,415Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 9, 2026 17:574,37744,412,87035,214,0001,121,0002,117,632stderr
2Jul 9, 2026 17:574,39544,593,53635,351,0001,131,0002,117,632stderr
3Jul 9, 2026 17:574,40644,649,79435,460,0001,110,0002,117,632stderr
4Jul 9, 2026 17:574,41044,732,18835,487,0001,116,0002,117,632stderr
5Jul 9, 2026 17:574,41544,769,94735,605,0001,047,0002,117,632stderr
6Jul 9, 2026 17:574,41744,863,56135,525,0001,144,0002,117,632stderr
7Jul 9, 2026 17:574,42144,778,32435,597,0001,099,0002,117,632stderr
8Jul 9, 2026 17:574,45545,081,07635,866,0001,115,0002,117,632stderr
9Jul 9, 2026 17:574,61546,448,25037,254,0001,058,0002,117,632stderr