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 4, 2026 10:20limanjun99limanjun99Score: 4,696Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 4, 2026 10:204,65856,290,36836,420,0002,244,0002,502,656
2May 4, 2026 10:204,66054,533,58436,422,0002,256,0002,498,560
3May 4, 2026 10:204,68555,370,12436,622,0002,270,0002,510,848
4May 4, 2026 10:204,68757,164,26335,596,0003,312,0002,510,848
5May 4, 2026 10:204,69656,675,82935,740,0003,244,0002,498,560
6May 4, 2026 10:204,72357,078,59935,950,0003,259,0002,494,464
7May 4, 2026 10:204,73356,589,75635,763,0003,523,0002,498,560
8May 4, 2026 10:204,73757,980,80036,039,0003,282,0002,498,560
9May 4, 2026 10:204,75258,038,18636,188,0003,257,0002,502,656