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 listJul 8, 2026 11:28Victor MerckléVictor MerckléScore: 4,135Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 8, 2026 11:294,12042,250,61633,072,0001,127,0002,117,632stderr
2Jul 8, 2026 11:294,12042,289,21933,084,0001,120,0002,117,632stderr
3Jul 8, 2026 11:294,12942,354,57533,253,0001,025,0002,117,632stderr
4Jul 8, 2026 11:294,13442,425,74633,287,0001,033,0002,117,632stderr
5Jul 8, 2026 11:294,13542,435,08633,213,0001,115,0002,117,632stderr
6Jul 8, 2026 11:294,13942,521,43633,288,0001,073,0002,117,632stderr
7Jul 8, 2026 11:294,17942,779,77433,573,0001,117,0002,117,632stderr
8Jul 8, 2026 11:294,19942,968,90933,842,0001,016,0002,117,632stderr
9Jul 8, 2026 11:294,36844,370,43835,128,0001,130,0002,117,632stderr