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 listJul 22, 2026 22:14Kevin HeaveyKevin HeaveyScore: 3,793Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 22, 2026 22:163,76241,090,83629,212,0002,018,0002,113,536
2Jul 22, 2026 22:163,77841,250,96429,259,0002,105,0002,113,536
3Jul 22, 2026 22:163,78141,258,03629,278,0002,111,0002,113,536
4Jul 22, 2026 22:163,78643,561,32529,341,0002,084,0002,113,536
5Jul 22, 2026 22:163,79341,364,33029,244,0002,240,0002,113,536
6Jul 22, 2026 22:163,94342,599,46730,676,0002,059,0002,113,536
7Jul 22, 2026 22:163,98942,952,10930,995,0002,119,0002,113,536
8Jul 22, 2026 22:164,02443,209,40730,955,0002,446,0002,113,536
9Jul 22, 2026 22:1663,817539,533,201527,642,0002,045,0002,113,536