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 8, 2026 12:33Daniel MastalerzDaniel MastalerzScore: 10,752Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 8, 2026 12:3310,715111,382,11486,933,0001,998,0002,310,144
2Feb 8, 2026 12:3310,715112,764,78485,936,0002,997,0002,293,760
3Feb 8, 2026 12:3310,746116,257,67383,177,0006,012,0002,322,432
4Feb 8, 2026 12:3310,748111,777,44782,193,0007,016,0002,269,184
5Feb 8, 2026 12:3310,752111,867,04580,214,0009,024,0002,371,584
6Feb 8, 2026 12:3310,752112,197,33580,216,0009,024,0002,326,528
7Feb 8, 2026 12:3310,761112,649,33082,294,0007,025,0002,314,240
8Feb 8, 2026 12:3310,769116,989,00481,348,0008,034,0002,351,104
9Feb 8, 2026 12:3310,780118,446,95582,434,0007,037,0002,318,336