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:27Josu San MartinJosu San MartinScore: 3,886Success
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:273,87041,619,29431,049,0001,078,0002,113,536
2May 10, 2026 19:273,88342,793,16431,151,0001,082,0002,113,536
3May 10, 2026 19:273,88442,402,44731,173,0001,072,0002,113,536
4May 10, 2026 19:273,88441,777,87331,157,0001,088,0002,113,536
5May 10, 2026 19:273,88640,882,29131,144,0001,115,0002,113,536
6May 10, 2026 19:273,88940,833,46031,184,0001,095,0002,113,536
7May 10, 2026 19:273,90741,083,33831,366,0001,067,0002,113,536
8May 10, 2026 19:273,91340,019,28831,385,0001,097,0002,113,536
9May 10, 2026 19:273,91542,426,38731,378,0001,121,0002,113,536