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 7, 2026 22:19zemledelzemledelScore: 98,215Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 7, 2026 22:2097,692820,472,110730,838,00080,012,0002,113,536
2Jul 7, 2026 22:2097,759820,918,123731,106,00080,301,0002,113,536
3Jul 7, 2026 22:2098,122823,923,589730,655,00083,759,0002,113,536
4Jul 7, 2026 22:2098,167824,359,464730,704,00084,089,0002,113,536
5Jul 7, 2026 22:2098,215824,686,518731,439,00083,746,0002,113,536
6Jul 7, 2026 22:2098,245824,971,633730,760,00084,680,0002,113,536
7Jul 7, 2026 22:2098,257825,023,169730,767,00084,773,0002,113,536
8Jul 7, 2026 22:2098,261825,117,750730,645,00084,926,0002,113,536
9Jul 7, 2026 22:2098,276825,438,712730,660,00085,037,0002,113,536