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 listMay 9, 2026 21:00Josu San MartinJosu San MartinScore: 4,900Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 9, 2026 21:014,86355,607,56239,322,0001,042,0002,347,008
2May 9, 2026 21:014,87656,032,51839,447,0001,030,0002,355,200
3May 9, 2026 21:014,88357,794,73639,509,0001,027,0002,359,296
4May 9, 2026 21:014,89955,523,63439,635,0001,031,0002,347,008
5May 9, 2026 21:014,90054,278,29639,646,0001,029,0002,355,200
6May 9, 2026 21:014,99157,485,90240,125,0001,307,0002,347,008
7May 9, 2026 21:015,03258,234,23740,722,0001,045,0002,355,200
8May 9, 2026 21:015,04157,506,66140,814,0001,033,0002,347,008
9May 9, 2026 21:015,06557,337,23641,007,0001,039,0002,347,008