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 listAug 28, 2026 05:02Victor MerckléVictor MerckléScore: 6,966Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 28, 2026 05:026,91265,721,92356,189,0001,187,0002,113,536
2Aug 28, 2026 05:026,92165,776,83156,276,0001,176,0002,113,536
3Aug 28, 2026 05:026,92165,615,83956,299,0001,151,0002,113,536
4Aug 28, 2026 05:026,92465,789,50056,318,0001,155,0002,113,536
5Aug 28, 2026 05:026,96666,188,22856,665,0001,156,0002,113,536
6Aug 28, 2026 05:026,97368,541,18556,869,0001,009,0002,113,536
7Aug 28, 2026 05:026,98066,137,34556,840,0001,102,0002,113,536
8Aug 28, 2026 05:026,99766,698,79756,894,0001,188,0002,113,536
9Aug 28, 2026 05:027,00166,333,08257,041,0001,075,0002,113,536