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 21:51Victor MerckléVictor MerckléScore: 10,251Success
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 21:5110,24293,816,92083,888,0001,122,0002,113,536
2May 11, 2026 21:5110,24693,763,48483,867,0001,176,0002,113,536
3May 11, 2026 21:5110,24996,100,18983,906,0001,162,0002,113,536
4May 11, 2026 21:5110,25194,560,05383,910,0001,180,0002,113,536
5May 11, 2026 21:5110,25196,744,18083,912,0001,177,0002,113,536
6May 11, 2026 21:5110,25293,899,07783,930,0001,167,0002,113,536
7May 11, 2026 21:5110,25395,255,12283,920,0001,181,0002,113,536
8May 11, 2026 21:5110,25595,374,81884,090,0001,032,0002,113,536
9May 11, 2026 21:5110,25795,919,44384,036,0001,100,0002,113,536