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 19:22Josu San MartinJosu San MartinScore: 3,913Success
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 19:223,88441,881,05131,165,0001,073,0002,113,536
2May 10, 2026 19:223,89143,042,13331,213,0001,083,0002,113,536
3May 10, 2026 19:223,89439,971,87631,233,0001,095,0002,113,536
4May 10, 2026 19:223,91039,865,67331,376,0001,082,0002,113,536
5May 10, 2026 19:223,91340,776,16731,382,0001,101,0002,113,536
6May 10, 2026 19:223,91742,555,48731,431,0001,088,0002,113,536
7May 10, 2026 19:223,92840,652,40731,524,0001,080,0002,113,536
8May 10, 2026 19:223,93042,140,26931,536,0001,087,0002,113,536
9May 10, 2026 19:223,93640,795,45431,591,0001,084,0002,113,536