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 23:34Daniel MastalerzDaniel MastalerzScore: 5,758Success
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 23:345,71368,834,89744,395,0003,026,0002,265,088
2Feb 19, 2026 23:345,71869,711,23343,418,0004,038,0002,265,088
3Feb 19, 2026 23:345,73468,104,09046,577,0001,012,0002,326,528
4Feb 19, 2026 23:345,74572,542,63645,653,0002,029,0002,523,136
5Feb 19, 2026 23:345,75373,354,17243,774,0003,979,0002,273,280
6Feb 19, 2026 23:345,75472,753,04043,777,0003,979,0002,330,624
7Feb 19, 2026 23:345,75873,105,84243,807,0003,982,0002,514,944
8Feb 19, 2026 23:345,76074,750,57043,827,0003,984,0002,330,624
9Feb 19, 2026 23:345,82871,945,92044,341,0004,031,0002,260,992
10Feb 19, 2026 23:345,83672,234,98944,401,0004,036,0002,277,376
11Feb 19, 2026 23:345,84478,887,94745,477,0003,031,0002,306,048
12Feb 19, 2026 23:345,86476,133,85245,631,0003,042,0002,265,088