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 10:29wnwnScore: 3,697Success
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 10:293,48944,402,40327,908,0001,055,0002,498,560
2May 10, 2026 10:293,50644,034,93728,045,0001,057,0002,482,176
3May 10, 2026 10:293,58944,820,55428,717,0001,077,0002,482,176
4May 10, 2026 10:293,62444,062,86229,034,0001,049,0002,482,176
5May 10, 2026 10:293,69747,166,07129,540,0001,146,0002,469,888
6May 10, 2026 10:293,70446,747,07829,677,0001,074,0002,473,984
7May 10, 2026 10:293,75147,174,56430,072,0001,069,0002,490,368
8May 10, 2026 10:293,77949,490,94430,289,0001,077,0002,486,272
9May 10, 2026 10:293,78346,444,41130,333,0001,072,0002,490,368