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 21:29Mikołaj UzarskiMikołaj UzarskiScore: 5,838Success
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 21:355,76371,288,08241,855,0005,979,0002,314,240
2Feb 19, 2026 21:365,79975,553,90042,117,0006,016,0002,486,272
3Feb 19, 2026 21:295,81375,601,40641,214,0007,036,0002,469,888
4Feb 19, 2026 21:355,82570,786,74041,300,0007,051,0002,293,760
5Feb 19, 2026 21:295,83871,337,79641,387,0007,066,0002,359,296
6Feb 19, 2026 21:295,84369,418,37441,421,0007,072,0002,392,064
7Feb 19, 2026 21:355,88871,568,93041,887,0006,981,0002,400,256
8Feb 19, 2026 21:365,97272,014,15242,485,0007,080,0002,437,120
9Feb 19, 2026 21:365,98874,457,43241,587,0008,114,0002,404,352