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 11, 2026 14:11Victor 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 11, 2026 14:11093,179,49582,311,0001,265,0002,113,536expected "53681307211351158 ", got "53681311211351158 "
2May 11, 2026 14:1110,06092,293,79282,266,0001,239,0002,113,536
3May 11, 2026 14:1110,06693,357,18082,281,0001,273,0002,113,536
4May 11, 2026 14:1110,06792,156,20482,291,0001,272,0002,113,536
5May 11, 2026 14:1110,06994,139,48782,300,0001,274,0002,113,536
6May 11, 2026 14:1110,06995,157,46982,301,0001,276,0002,113,536
7May 11, 2026 14:1110,07193,734,96982,578,0001,019,0002,113,536
8May 11, 2026 14:1110,07194,467,16782,578,0001,019,0002,113,536
9May 11, 2026 14:1110,10094,248,41982,581,0001,253,0002,113,536