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 19:37Maya RebholzMaya RebholzError
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 19:37078,715,49263,447,0005,574,0002,113,536expected "53687030246469492 ", got "sum after prologue = 18300372054 53687030246469492 "
2May 24, 2026 19:37079,741,87562,800,0005,481,0002,117,632expected "53690653927566684 ", got "sum after prologue = 0 53690653927566684 "
3May 24, 2026 19:37078,973,16763,141,0005,779,0002,113,536expected "53682007656645822 ", got "sum after prologue = 20549388347 53682007656645822 "