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 listAug 11, 2026 17:08Victor MerckléVictor MerckléScore: 3,862Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 11, 2026 17:093,83740,223,24930,840,0001,010,0002,117,632stderr
2Aug 11, 2026 17:093,84441,458,41130,763,0001,150,0002,117,632stderr
3Aug 11, 2026 17:093,85740,449,83430,992,0001,029,0002,117,632stderr
4Aug 11, 2026 17:093,86240,481,39230,936,0001,119,0002,117,632stderr
5Aug 11, 2026 17:093,86240,473,35730,927,0001,129,0002,117,632stderr
6Aug 11, 2026 17:093,86340,274,39330,991,0001,077,0002,117,632stderr
7Aug 11, 2026 17:093,86640,560,63630,911,0001,185,0002,117,632stderr
8Aug 11, 2026 17:093,89240,719,13731,190,0001,119,0002,117,632stderr
9Aug 11, 2026 17:093,92640,950,77931,568,0001,024,0002,117,632stderr