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:45Mikołaj UzarskiMikołaj UzarskiScore: 7,004Success
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:486,91181,093,84751,324,0006,038,0002,437,120
2Feb 13, 2026 23:486,96186,439,27450,807,0006,973,0002,359,296
3Feb 13, 2026 23:486,98183,832,61151,948,0005,994,0002,473,984
4Feb 13, 2026 23:487,00281,094,31551,104,0007,014,0002,347,008
5Feb 13, 2026 23:487,00481,833,68552,122,0006,014,0002,396,160
6Feb 13, 2026 23:487,01690,434,03652,208,0006,024,0002,461,696
7Feb 13, 2026 23:487,04185,327,28353,405,0005,038,0002,437,120
8Feb 13, 2026 23:487,10085,531,27951,940,0006,991,0002,281,472
9Feb 13, 2026 23:487,10079,728,25551,941,0006,992,0002,490,368