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 09:51limanjun99limanjun99Score: 4,670Success
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 09:524,64354,339,81736,275,0002,268,0002,498,560
2May 4, 2026 09:524,66154,779,12835,435,0003,256,0002,514,944
3May 4, 2026 09:524,66457,110,47735,422,0003,297,0002,510,848
4May 4, 2026 09:524,66956,017,02135,437,0003,321,0002,510,848
5May 4, 2026 09:524,67054,328,22735,333,0003,434,0002,502,656
6May 4, 2026 09:524,67156,585,76535,524,0003,247,0002,502,656
7May 4, 2026 09:524,67554,525,23436,453,0002,354,0002,502,656
8May 4, 2026 09:524,70756,874,74535,830,0003,245,0002,494,464
9May 4, 2026 09:524,75357,963,15936,235,0003,221,0002,494,464