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 14, 2026 01:00Victor 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
1May 14, 2026 01:01069,319,01161,941,00002,113,536expected "53683885158541377 ", got "53683882854541377 "
2May 14, 2026 01:017,46071,256,86461,923,00002,113,536
3May 14, 2026 01:017,46170,157,33161,934,00002,113,536
4May 14, 2026 01:017,46471,287,23761,954,00002,113,536
5May 14, 2026 01:017,47171,321,34261,016,0001,001,0002,113,536
6May 14, 2026 01:017,47270,935,90661,017,0001,001,0002,113,536
7May 14, 2026 01:017,47370,963,09461,013,0001,019,0002,113,536
8May 14, 2026 01:017,47569,888,53061,003,0001,043,0002,113,536
9May 14, 2026 01:017,48871,049,23760,997,0001,157,0002,113,536