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:08Mikołaj UzarskiMikołaj UzarskiScore: 7,336Success
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:107,23582,873,52953,048,0007,006,0002,514,944
2Feb 19, 2026 23:117,26986,325,92453,297,0007,039,0002,293,760
3Feb 19, 2026 23:107,27383,120,48952,314,0008,048,0002,293,760
4Feb 19, 2026 23:117,33689,236,08853,905,0006,987,0002,338,816
5Feb 19, 2026 23:117,37687,099,93254,193,0007,025,0002,387,968
6Feb 19, 2026 23:107,49684,565,87155,192,0007,024,0002,445,312