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 20, 2026 20:43Kevin HeaveyKevin HeaveyScore: 3,618Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 20, 2026 20:443,59039,451,64028,571,0001,227,0002,113,536
2Jul 20, 2026 20:443,59539,607,11028,600,0001,246,0002,113,536
3Jul 20, 2026 20:443,59739,472,62828,649,0001,211,0002,113,536
4Jul 20, 2026 20:443,61039,597,04928,728,0001,238,0002,113,536
5Jul 20, 2026 20:443,61839,724,11829,011,0001,022,0002,113,536
6Jul 20, 2026 20:443,62039,637,40629,004,0001,047,0002,113,536
7Jul 20, 2026 20:443,66740,078,72429,397,0001,046,0002,113,536
8Jul 20, 2026 20:443,68240,204,03429,324,0001,238,0002,113,536
9Jul 20, 2026 20:443,83441,580,28930,634,0001,195,0002,113,536