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 11, 2026 00:33Josu San MartinJosu San MartinScore: 6,076Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 11, 2026 00:336,05160,238,06649,167,0001,064,0002,113,536
2May 11, 2026 00:336,06558,820,39949,266,0001,081,0002,113,536
3May 11, 2026 00:336,07059,922,84049,286,0001,098,0002,113,536
4May 11, 2026 00:336,07158,515,53249,313,0001,077,0002,113,536
5May 11, 2026 00:336,07660,100,74949,351,0001,085,0002,113,536
6May 11, 2026 00:336,09858,816,44949,551,0001,069,0002,113,536
7May 11, 2026 00:336,10660,071,36849,582,0001,106,0002,113,536
8May 11, 2026 00:336,10659,083,18949,592,0001,090,0002,113,536
9May 11, 2026 00:336,11260,623,82049,643,0001,091,0002,113,536