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 2, 2026 13:12Victor MerckléVictor MerckléScore: 5,670Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 2, 2026 13:135,65455,366,67945,907,0001,026,0002,117,632stderr
2Sep 2, 2026 13:135,65656,038,35745,927,0001,019,0002,117,632stderr
3Sep 2, 2026 13:135,66555,382,74246,010,0001,016,0002,117,632stderr
4Sep 2, 2026 13:135,66855,428,03846,022,0001,028,0002,117,632stderr
5Sep 2, 2026 13:135,67055,428,96646,049,0001,018,0002,117,632stderr
6Sep 2, 2026 13:135,67356,256,27846,060,0001,032,0002,117,632stderr
7Sep 2, 2026 13:135,73456,742,55346,570,0001,026,0002,117,632stderr
8Sep 2, 2026 13:135,73456,728,73746,570,0001,028,0002,117,632stderr
9Sep 2, 2026 13:135,95957,860,38048,447,0001,020,0002,117,632stderr