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 listJun 27, 2026 01:03Code HintsCode HintsScore: 7,107Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 27, 2026 01:037,08366,320,65055,648,0003,147,0002,113,536
2Jun 27, 2026 01:037,08666,342,12255,728,0003,088,0002,113,536
3Jun 27, 2026 01:037,08866,932,14155,635,0003,201,0002,113,536
4Jun 27, 2026 01:037,09866,445,13955,766,0003,154,0002,113,536
5Jun 27, 2026 01:037,10766,739,91055,883,0003,113,0002,113,536
6Jun 27, 2026 01:037,17167,011,70756,362,0003,165,0002,113,536
7Jun 27, 2026 01:037,17368,221,94656,397,0003,140,0002,113,536
8Jun 27, 2026 01:037,20267,289,39956,652,0003,126,0002,113,536
9Jun 27, 2026 01:038,43677,738,42867,981,0002,046,0002,113,536