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 23:22Victor MerckléVictor MerckléScore: 4,316Success
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 23:234,29744,159,56534,570,0001,103,0002,117,632stderr
2Aug 11, 2026 23:234,29945,363,75334,652,0001,034,0002,117,632stderr
3Aug 11, 2026 23:234,30543,933,09734,607,0001,132,0002,117,632stderr
4Aug 11, 2026 23:234,30943,920,13434,668,0001,100,0002,117,632stderr
5Aug 11, 2026 23:234,31644,213,27634,792,0001,033,0002,117,632stderr
6Aug 11, 2026 23:234,31644,024,88434,812,0001,016,0002,117,632stderr
7Aug 11, 2026 23:234,32844,083,40034,920,0001,009,0002,117,632stderr
8Aug 11, 2026 23:234,41545,065,01335,636,0001,015,0002,117,632stderr
9Aug 11, 2026 23:234,52045,666,10936,425,0001,098,0002,117,632stderr