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:21Victor MerckléVictor MerckléScore: 10,245Success
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:2110,23996,379,11983,824,0001,163,0002,113,536
2May 11, 2026 14:2110,24094,635,05983,818,0001,182,0002,113,536
3May 11, 2026 14:2110,24395,620,97483,836,0001,182,0002,113,536
4May 11, 2026 14:2110,24496,427,02683,850,0001,183,0002,113,536
5May 11, 2026 14:2110,24594,125,99683,849,0001,189,0002,113,536
6May 11, 2026 14:2110,24893,727,30483,864,0001,195,0002,113,536
7May 11, 2026 14:2110,25496,055,78384,059,0001,055,0002,113,536
8May 11, 2026 14:2110,25595,578,62084,033,0001,086,0002,113,536
9May 11, 2026 14:2110,27895,877,11284,121,0001,189,0002,113,536