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 06:19Victor MerckléVictor MerckléScore: 22,088Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 9, 2026 06:2120,263176,258,413167,086,0001,097,0002,117,632stderr
2Jul 9, 2026 06:2120,287176,597,898167,282,0001,101,0002,117,632stderr
3Jul 9, 2026 06:2120,291176,618,758167,327,0001,091,0002,117,632stderr
4Jul 9, 2026 06:2120,311176,787,525167,407,0001,180,0002,117,632stderr
5Jul 9, 2026 06:2122,088191,472,022182,158,0001,177,0002,117,632stderr
6Jul 9, 2026 06:2122,100191,761,545182,228,0001,209,0002,117,632stderr
7Jul 9, 2026 06:2122,105191,823,041182,468,0001,006,0002,117,632stderr
8Jul 9, 2026 06:2122,210192,433,257183,223,0001,120,0002,117,632stderr
9Jul 9, 2026 06:2122,300193,409,877183,864,0001,231,0002,117,632stderr