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 listJul 7, 2026 14:29Victor MerckléVictor MerckléScore: 4,998Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 7, 2026 14:304,81348,299,87238,948,0001,007,0002,117,632stderr
2Jul 7, 2026 14:304,82948,110,92638,962,0001,123,0002,117,632stderr
3Jul 7, 2026 14:304,87348,514,50239,396,0001,051,0002,117,632stderr
4Jul 7, 2026 14:304,98749,261,18140,274,0001,125,0002,117,632stderr
5Jul 7, 2026 14:304,99850,479,76140,385,0001,103,0002,117,632stderr
6Jul 7, 2026 14:305,01549,678,30540,486,0001,144,0002,117,632stderr
7Jul 7, 2026 14:305,01549,713,13440,601,0001,031,0002,117,632stderr
8Jul 7, 2026 14:305,02349,682,59940,634,0001,060,0002,117,632stderr
9Jul 7, 2026 14:305,02549,720,23140,614,0001,094,0002,117,632stderr