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 13:41Josu San MartinJosu San MartinScore: 4,398Success
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 13:414,35746,011,28835,099,0001,070,0002,113,536
2May 10, 2026 13:414,36143,984,14735,138,0001,062,0002,113,536
3May 10, 2026 13:414,36146,012,28435,153,0001,050,0002,113,536
4May 10, 2026 13:414,38645,278,62735,347,0001,064,0002,113,536
5May 10, 2026 13:414,39847,149,84335,399,0001,111,0002,113,536
6May 10, 2026 13:414,40246,138,54635,483,0001,058,0002,113,536
7May 10, 2026 13:414,40944,978,56735,548,0001,047,0002,113,536
8May 10, 2026 13:414,43646,529,52635,772,0001,052,0002,113,536
9May 10, 2026 13:414,46346,165,14935,992,0001,051,0002,113,536