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 15, 2026 01:40Victor 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 15, 2026 01:41067,983,40058,652,0001,034,0002,113,536expected "53694483023916070 ", got "53694459983916070 "
2May 15, 2026 01:417,19868,643,06459,744,00002,113,536
3May 15, 2026 01:417,19968,736,98858,756,0001,002,0002,113,536
4May 15, 2026 01:417,20069,805,28759,766,00002,113,536
5May 15, 2026 01:417,20068,339,08859,760,00002,113,536
6May 15, 2026 01:417,20167,088,75059,773,00002,113,536
7May 15, 2026 01:417,21074,167,62258,828,0001,018,0002,113,536
8May 15, 2026 01:417,25370,514,92560,205,00002,113,536
9May 15, 2026 01:417,25869,150,01560,248,00002,113,536