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:14Victor 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:14038,271,64528,840,0001,110,0002,113,536expected "53682986240919055 ", got "0 "
2Sep 2, 2026 03:14038,376,10728,997,0001,003,0002,113,536expected "53693172689806765 ", got "0 "
3Sep 2, 2026 03:14038,517,48629,122,0001,065,0002,113,536expected "53687195152401627 ", got "0 "