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:32Daniel MastalerzDaniel MastalerzScore: 13,173Success
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:3113,142130,828,172103,077,0006,004,0002,301,952
2Feb 8, 2026 12:3113,144137,964,177102,093,0007,006,0002,363,392
3Feb 8, 2026 12:3113,146133,984,734103,103,0006,006,0002,400,256
4Feb 8, 2026 12:3113,153130,390,270104,165,0005,007,0002,322,432
5Feb 8, 2026 12:3113,158140,067,631103,200,0006,011,0002,318,336
6Feb 8, 2026 12:3113,160129,956,663102,210,0007,014,0002,301,952
7Feb 8, 2026 12:3113,173134,364,844104,320,0005,015,0002,396,160
8Feb 8, 2026 12:3213,176139,838,556104,344,0005,016,0002,514,944
9Feb 8, 2026 12:3113,178137,175,949104,363,0005,017,0002,514,944
10Feb 8, 2026 12:3213,183132,022,559107,408,0002,007,0002,318,336
11Feb 8, 2026 12:3113,231130,074,953103,830,0005,990,0002,318,336
12Feb 8, 2026 12:3213,313141,069,190104,469,0006,027,0002,363,392