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 13, 2026 18:09Victor 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 13, 2026 18:09072,233,99562,051,0001,004,0002,113,536expected "53690959287386612 ", got "53690956983386612 "
2May 13, 2026 18:097,59272,507,50763,016,00002,113,536
3May 13, 2026 18:097,59772,508,40963,061,00002,113,536
4May 13, 2026 18:097,60872,455,33262,150,0001,001,0002,113,536
5May 13, 2026 18:097,61372,549,63462,155,0001,041,0002,113,536
6May 13, 2026 18:097,61573,304,40062,158,0001,050,0002,113,536
7May 13, 2026 18:097,61971,870,15862,215,0001,030,0002,113,536
8May 13, 2026 18:097,63170,571,79962,304,0001,041,0002,113,536
9May 13, 2026 18:097,70571,213,81563,952,00002,113,536