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 13, 2026 21:38Victor MerckléVictor MerckléScore: 4,250Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 13, 2026 21:394,07144,103,36732,727,0001,070,0002,117,632stderr
2Sep 13, 2026 21:394,09543,701,39632,931,0001,058,0002,117,632stderr
3Sep 13, 2026 21:394,12243,989,13533,141,0001,077,0002,117,632stderr
4Sep 13, 2026 21:394,15844,888,23433,463,0001,052,0002,117,632stderr
5Sep 13, 2026 21:394,25045,614,26334,214,0001,067,0002,117,632stderr
6Sep 13, 2026 21:394,26345,404,62234,328,0001,056,0002,117,632stderr
7Sep 13, 2026 21:394,26645,135,50034,338,0001,073,0002,117,632stderr
8Sep 13, 2026 21:394,28846,129,30734,567,0001,025,0002,117,632stderr
9Sep 13, 2026 21:394,32046,550,63734,781,0001,076,0002,117,632stderr