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 listFeb 23, 2026 21:41Daniel MastalerzDaniel MastalerzScore: 6,122Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 23, 2026 21:416,00775,975,20146,865,0002,991,0002,285,568
2Feb 23, 2026 21:416,03581,160,05547,088,0003,005,0002,510,848
3Feb 23, 2026 21:416,03777,432,01044,092,0006,012,0002,482,176
4Feb 23, 2026 21:416,12275,942,05846,830,0003,985,0002,281,472
5Feb 23, 2026 21:416,13073,456,80546,887,0003,990,0002,486,272
6Feb 23, 2026 21:416,13376,001,12045,912,0004,990,0002,265,088