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 19, 2026 21:22Daniel MastalerzDaniel MastalerzScore: 6,484Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 19, 2026 21:226,32675,940,71748,466,0004,038,0002,326,528
2Feb 19, 2026 21:226,38675,944,88649,003,0004,000,0002,326,528
3Feb 19, 2026 21:226,44577,209,62651,479,0002,018,0002,306,048
4Feb 19, 2026 21:226,48482,271,83049,828,0003,986,0002,269,184
5Feb 19, 2026 21:226,52079,212,77751,110,0003,006,0002,269,184
6Feb 19, 2026 21:226,61080,088,91949,878,0004,987,0002,277,376