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 21, 2026 17:07Victor MerckléVictor MerckléScore: 5,135Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 21, 2026 17:115,11652,434,70541,276,0001,191,0002,125,824
2May 21, 2026 17:115,12152,338,22541,296,0001,216,0002,125,824
3May 21, 2026 17:115,12452,505,24241,293,0001,238,0002,125,824
4May 21, 2026 17:115,13253,677,48741,412,0001,189,0002,125,824
5May 21, 2026 17:115,13552,613,06541,386,0001,238,0002,125,824
6May 21, 2026 17:115,13553,110,26141,432,0001,191,0002,125,824
7May 21, 2026 17:115,13853,548,94841,477,0001,173,0002,125,824
8May 21, 2026 17:115,14252,758,58940,657,0002,022,0002,125,824
9May 21, 2026 17:115,14252,075,75041,535,0001,149,0002,125,824