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 12:08Victor MerckléVictor MerckléScore: 8,232Success
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 12:088,21277,607,26467,134,0001,033,0002,113,536
2May 13, 2026 12:088,21379,931,19567,159,0001,011,0002,113,536
3May 13, 2026 12:088,21577,626,32467,176,0001,013,0002,113,536
4May 13, 2026 12:088,21675,564,60867,158,0001,035,0002,113,536
5May 13, 2026 12:088,23278,408,73067,293,0001,037,0002,113,536
6May 13, 2026 12:088,23578,395,65467,341,0001,013,0002,113,536
7May 13, 2026 12:088,23678,665,38968,364,00002,113,536
8May 13, 2026 12:088,24777,337,40467,422,0001,032,0002,113,536
9May 13, 2026 12:088,36376,771,36768,387,0001,029,0002,113,536