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 8, 2026 11:33Victor MerckléVictor MerckléScore: 4,093Success
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 8, 2026 13:08wn10.00CustomSolution Held
Jul 8, 2026 13:08wn10.00CustomSolution Held
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 8, 2026 11:344,07741,864,88332,739,0001,107,0002,117,632stderr
2Jul 8, 2026 11:344,07841,730,92032,750,0001,103,0002,117,632stderr
3Jul 8, 2026 11:344,08841,837,70132,929,0001,008,0002,117,632stderr
4Jul 8, 2026 11:344,08941,826,29932,812,0001,128,0002,117,632stderr
5Jul 8, 2026 11:344,09341,873,83132,827,0001,146,0002,117,632stderr
6Jul 8, 2026 11:344,09642,112,69732,889,0001,108,0002,117,632stderr
7Jul 8, 2026 11:344,09941,989,41632,887,0001,136,0002,117,632stderr
8Jul 8, 2026 11:344,12542,111,26233,196,0001,047,0002,117,632stderr
9Jul 8, 2026 11:344,12642,130,49433,143,0001,104,0002,117,632stderr