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 13:16wnwnScore: 3,572Success
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 13:173,38643,238,06227,052,0001,057,0002,490,368
2May 9, 2026 13:173,39240,254,73627,105,0001,055,0002,490,368
3May 9, 2026 13:173,39342,672,66327,087,0001,083,0002,490,368
4May 9, 2026 13:173,53544,270,33828,241,0001,103,0002,498,560
5May 9, 2026 13:173,57246,926,17728,544,0001,104,0002,486,272
6May 9, 2026 13:173,57844,601,56528,627,0001,077,0002,473,984
7May 9, 2026 13:173,57843,576,16128,596,0001,105,0002,469,888
8May 9, 2026 13:173,58045,627,45728,631,0001,086,0002,494,464
9May 9, 2026 13:173,61647,271,66928,895,0001,125,0002,478,080