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 05:58M-RochatM-RochatScore: 11,807Success
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 05:5911,780109,003,00195,435,0002,342,0002,113,536
2May 20, 2026 05:5911,796108,567,74795,566,0002,343,0002,113,536
3May 20, 2026 05:5911,801108,003,17595,616,0002,333,0002,113,536
4May 20, 2026 05:5911,807109,351,47095,647,0002,354,0002,113,536
5May 20, 2026 05:5911,807107,956,77695,983,0002,016,0002,113,536
6May 20, 2026 05:5911,819107,724,71095,736,0002,362,0002,113,536
7May 20, 2026 05:5911,820109,755,75695,761,0002,352,0002,113,536
8May 20, 2026 05:5911,887111,385,35096,610,0002,056,0002,113,536
9May 20, 2026 05:5911,907108,464,65796,777,0002,058,0002,113,536