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 7, 2026 10:02wnwnScore: 3,536Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 7, 2026 10:023,38643,990,51527,054,0001,057,0002,490,368
2May 7, 2026 10:023,42244,515,51827,303,0001,102,0002,478,080
3May 7, 2026 10:023,45142,067,28827,567,0001,082,0002,486,272
4May 7, 2026 10:023,45444,868,94527,591,0001,081,0002,490,368
5May 7, 2026 10:023,53643,676,13228,246,0001,107,0002,478,080
6May 7, 2026 10:023,59345,732,27028,749,0001,081,0002,482,176
7May 7, 2026 10:023,59644,567,66728,742,0001,108,0002,486,272
8May 7, 2026 10:023,59844,899,26028,733,0001,134,0002,490,368
9May 7, 2026 10:023,87450,462,55929,104,0003,057,0002,478,080