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 13:30Victor 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 24, 2026 13:30072,449,86561,753,0001,190,0002,113,536expected "53700062606600990 ", got "53700060302600990 "
2May 24, 2026 13:307,51370,143,59761,247,0001,117,0002,113,536
3May 24, 2026 13:307,51970,379,12261,276,0001,137,0002,113,536
4May 24, 2026 13:307,52272,039,40261,250,0001,185,0002,113,536
5May 24, 2026 13:307,52973,084,05361,318,0001,174,0002,113,536
6May 24, 2026 13:307,54470,390,28861,608,0001,013,0002,113,536
7May 24, 2026 13:307,55771,664,59161,615,0001,111,0002,113,536
8May 24, 2026 13:307,57572,513,97561,744,0001,133,0002,113,536
9May 24, 2026 13:307,58774,597,33461,815,0001,163,0002,113,536