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 9, 2026 17:25Victor MerckléVictor MerckléScore: 4,091Success
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 10, 2026 06:11wn10.00CustomSolution Held
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 9, 2026 17:264,05241,499,28932,518,0001,120,0002,117,632stderr
2Jul 9, 2026 17:264,07741,986,07932,718,0001,125,0002,117,632stderr
3Jul 9, 2026 17:264,08542,030,46632,818,0001,093,0002,117,632stderr
4Jul 9, 2026 17:264,09043,514,59732,835,0001,120,0002,117,632stderr
5Jul 9, 2026 17:264,09142,001,46132,940,0001,022,0002,117,632stderr
6Jul 9, 2026 17:264,09942,111,14032,995,0001,028,0002,117,632stderr
7Jul 9, 2026 17:264,10242,169,84832,951,0001,102,0002,117,632stderr
8Jul 9, 2026 17:264,19942,919,44633,746,0001,112,0002,117,632stderr
9Jul 9, 2026 17:264,20443,004,67033,884,0001,010,0002,117,632stderr