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 23, 2026 23:33Victor MerckléVictor MerckléScore: 10,335Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 23, 2026 23:3410,30195,205,14484,438,0001,067,0002,113,536
2May 23, 2026 23:3410,30193,802,74484,437,0001,066,0002,113,536
3May 23, 2026 23:3410,31895,768,25384,575,0001,070,0002,113,536
4May 23, 2026 23:3410,32695,176,33484,696,0001,017,0002,113,536
5May 23, 2026 23:3410,33594,766,20584,785,0001,002,0002,113,536
6May 23, 2026 23:3410,33695,219,94884,735,0001,061,0002,113,536
7May 23, 2026 23:3410,33796,545,68384,755,0001,046,0002,113,536
8May 23, 2026 23:3410,34196,795,61184,803,0001,028,0002,113,536
9May 23, 2026 23:3410,34994,525,39484,692,0001,209,0002,113,536