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 24, 2026 20:11Victor MerckléVictor MerckléScore: 4,581Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 24, 2026 20:114,56445,753,07236,830,0001,059,0002,113,536
2May 24, 2026 20:114,56747,857,64036,845,0001,067,0002,113,536
3May 24, 2026 20:114,57447,115,16836,900,0001,066,0002,113,536
4May 24, 2026 20:114,57546,040,10736,908,0001,066,0002,113,536
5May 24, 2026 20:114,58148,402,99137,003,0001,025,0002,113,536
6May 24, 2026 20:114,59347,674,34537,078,0001,044,0002,113,536
7May 24, 2026 20:114,61348,364,79037,253,0001,037,0002,113,536
8May 24, 2026 20:114,61547,842,65737,302,0001,007,0002,113,536
9May 24, 2026 20:114,90550,533,62839,621,0001,094,0002,113,536