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

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 10, 2026 10:153,37844,525,03327,001,0001,039,0002,490,368
2May 10, 2026 10:153,38444,495,77227,037,0001,055,0002,486,272
3May 10, 2026 10:153,38841,972,09527,072,0001,055,0002,486,272
4May 10, 2026 10:153,39042,011,22827,096,0001,042,0002,490,368
5May 10, 2026 10:153,39543,856,73027,123,0001,057,0002,490,368
6May 10, 2026 10:153,42444,247,01327,347,0001,073,0002,490,368
7May 10, 2026 10:153,57947,888,55828,629,0001,078,0002,490,368
8May 10, 2026 10:153,58646,965,89928,666,0001,104,0002,478,080
9May 10, 2026 10:153,60647,043,66528,743,0001,191,0002,478,080