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 13, 2026 23:23Mikołaj UzarskiMikołaj UzarskiScore: 7,016Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 13, 2026 23:236,87176,836,45852,027,0005,002,0002,441,216
2Feb 13, 2026 23:236,92580,707,24451,427,0006,050,0002,289,664
3Feb 13, 2026 23:236,97183,319,23051,874,0005,985,0002,527,232
4Feb 13, 2026 23:236,98780,470,04752,996,0004,999,0002,502,656
5Feb 13, 2026 23:237,01686,323,38952,209,0006,024,0002,469,888
6Feb 13, 2026 23:237,03179,434,14852,319,0006,036,0002,457,600
7Feb 13, 2026 23:237,03579,061,61253,358,0005,033,0002,478,080
8Feb 13, 2026 23:237,05485,400,32851,484,0007,066,0002,400,256
9Feb 13, 2026 23:237,05886,780,26753,615,0004,964,0002,285,568