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 20, 2026 10:22M-RochatM-RochatScore: 7,200Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 20, 2026 10:227,11668,499,96157,000,0002,066,0002,113,536
2May 20, 2026 10:227,13968,641,24357,190,0002,067,0002,113,536
3May 20, 2026 10:227,18770,693,26157,522,0002,133,0002,113,536
4May 20, 2026 10:227,19871,634,37557,585,0002,164,0002,113,536
5May 20, 2026 10:227,20069,812,61857,626,0002,142,0002,113,536
6May 20, 2026 10:227,20173,258,63057,589,0002,186,0002,113,536
7May 20, 2026 10:227,21270,712,31157,687,0002,174,0002,113,536
8May 20, 2026 10:227,24373,498,74157,935,0002,186,0002,113,536
9May 20, 2026 10:227,28671,825,51758,321,0002,161,0002,113,536