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 19, 2026 17:12Adam FolwarcznyAdam FolwarcznyScore: 19,355Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 19, 2026 17:1219,197169,830,883158,339,0001,004,0002,113,536
2Jul 19, 2026 17:1219,201169,115,448158,186,0001,188,0002,113,536
3Jul 19, 2026 17:1219,208169,185,189158,157,0001,273,0002,113,536
4Jul 19, 2026 17:1219,215169,296,870158,478,0001,013,0002,113,536
5Jul 19, 2026 17:1219,355170,445,007159,376,0001,276,0002,113,536
6Jul 19, 2026 17:1219,391170,891,198159,941,0001,005,0002,113,536
7Jul 19, 2026 17:1219,435171,781,514160,309,0001,007,0002,113,536
8Jul 19, 2026 17:1219,490172,204,021160,769,0001,006,0002,113,536
9Jul 19, 2026 17:1220,001175,823,847165,012,0001,004,0002,113,536