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 18, 2026 00:24olliecrowolliecrowScore: 5,903Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 18, 2026 00:245,52271,865,97739,852,0005,977,0002,408,448
2Feb 18, 2026 00:245,55373,457,49545,092,0001,002,0002,314,240
3Feb 18, 2026 00:245,69970,135,17045,290,0002,012,0002,265,088
4Feb 18, 2026 00:245,83077,316,76647,383,0001,008,0002,285,568
5Feb 18, 2026 00:245,86973,203,19146,723,0001,988,0002,527,232
6Feb 18, 2026 00:245,88177,568,95246,824,0001,992,0002,424,832
7Feb 18, 2026 00:245,90381,915,41547,997,000999,0002,478,080
8Feb 18, 2026 00:245,94176,199,89248,304,0001,006,0002,478,080
9Feb 18, 2026 00:246,00078,127,77647,807,0001,991,0002,478,080
10Feb 18, 2026 00:246,00981,031,86845,886,0003,990,0002,437,120
11Feb 18, 2026 00:246,04982,443,71848,201,0002,008,0002,424,832
12Feb 18, 2026 00:246,07478,736,46246,379,0004,033,0002,387,968