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 21:24Victor MerckléVictor MerckléScore: 43,164Success
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 21:2742,974365,283,914355,682,0001,005,0002,117,632stderr
2Sep 8, 2026 21:2742,998365,620,937355,877,0001,008,0002,117,632stderr
3Sep 8, 2026 21:2743,024365,689,811355,921,0001,181,0002,117,632stderr
4Sep 8, 2026 21:2743,106366,954,190356,779,0001,003,0002,117,632stderr
5Sep 8, 2026 21:2743,164368,379,619357,248,0001,020,0002,117,632stderr
6Sep 8, 2026 21:2743,165366,923,273357,126,0001,148,0002,117,632stderr
7Sep 8, 2026 21:2743,175367,511,794357,212,0001,142,0002,117,632stderr
8Sep 8, 2026 21:2743,208367,788,447357,622,0001,012,0002,117,632stderr
9Sep 8, 2026 21:2743,228367,366,220357,787,0001,012,0002,117,632stderr