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 listFeb 17, 2026 19:04wnwnScore: 7,583Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 17, 2026 19:046,45979,249,41350,629,0002,978,0002,334,720
2Feb 17, 2026 19:046,49676,279,04751,917,0001,996,0002,482,176
3Feb 17, 2026 19:046,51976,809,35252,105,0002,004,0002,519,040
4Feb 17, 2026 19:047,58387,599,62660,945,0001,998,0002,359,296
5Feb 17, 2026 19:047,64183,306,19059,393,0004,026,0002,424,832
6Feb 17, 2026 19:047,68796,132,93460,814,0002,990,0002,428,928