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 3, 2026 22:54Victor MerckléVictor MerckléScore: 3,921Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 3, 2026 22:543,74339,605,77830,016,0001,058,0002,117,632stderr
2Sep 3, 2026 22:543,77139,728,47430,251,0001,053,0002,117,632stderr
3Sep 3, 2026 22:543,85340,402,81130,891,0001,096,0002,117,632stderr
4Sep 3, 2026 22:543,88040,668,73531,139,0001,070,0002,117,632stderr
5Sep 3, 2026 22:543,92141,155,36331,453,0001,099,0002,117,632stderr
6Sep 3, 2026 22:543,93541,081,15131,578,0001,085,0002,117,632stderr
7Sep 3, 2026 22:543,93641,098,18131,594,0001,080,0002,117,632stderr
8Sep 3, 2026 22:543,95341,891,29431,745,0001,071,0002,117,632stderr
9Sep 3, 2026 22:543,95741,250,53231,758,0001,092,0002,117,632stderr