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 24, 2026 20:27Daniel MastalerzDaniel MastalerzScore: 5,479Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 24, 2026 20:275,37174,381,08741,540,0003,039,0002,285,568
2Feb 24, 2026 20:275,39670,972,37641,801,0002,985,0002,387,968
3Feb 24, 2026 20:275,39772,853,41940,816,0003,982,0002,318,336
4Feb 24, 2026 20:275,47967,099,57142,442,0003,031,0002,281,472
5Feb 24, 2026 20:275,48274,282,14643,477,0002,022,0002,260,992
6Feb 24, 2026 20:275,48981,599,99742,521,0003,037,0002,318,336