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 listSep 2, 2026 03:02Victor MerckléVictor MerckléError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 2, 2026 03:02037,444,89628,079,0001,073,0002,113,536expected "53687922057792588 ", got "0 "
2Sep 2, 2026 03:02038,241,19828,689,0001,076,0002,113,536expected "53679738197177282 ", got "0 "
3Sep 2, 2026 03:02037,501,77028,097,0001,088,0002,113,536expected "53688523494388091 ", got "0 "