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 20, 2026 16:32Daniel MastalerzDaniel MastalerzScore: 5,817Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 20, 2026 16:325,73375,179,22044,545,0003,037,0002,322,432
2Feb 20, 2026 16:325,74174,007,27844,610,0003,041,0002,514,944
3Feb 20, 2026 16:325,74580,262,30444,640,0003,043,0002,269,184
4Feb 20, 2026 16:325,81780,430,17745,261,0003,017,0002,301,952
5Feb 20, 2026 16:325,83571,250,07544,392,0004,035,0002,281,472
6Feb 20, 2026 16:325,84274,816,52446,466,0002,020,0002,293,760