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 24, 2026 22:17Mikołaj UzarskiMikołaj UzarskiScore: 5,137Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 24, 2026 22:175,11470,376,11741,435,0001,010,0002,281,472
2Feb 24, 2026 22:175,12466,793,47041,517,0001,012,0002,281,472
3Feb 24, 2026 22:175,12769,501,09040,531,0002,026,0002,285,568
4Feb 24, 2026 22:175,13070,660,64441,564,0001,013,0002,375,680
5Feb 24, 2026 22:175,13767,801,29541,623,0001,015,0002,285,568
6Feb 24, 2026 22:175,15970,687,09041,822,000995,0002,281,472
7Feb 24, 2026 22:175,19173,633,94841,084,0002,004,0002,510,848
8Feb 24, 2026 22:175,20567,684,68441,196,0002,009,0002,502,656
9Feb 24, 2026 22:175,21166,908,56741,241,0002,011,0002,281,472