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 listMay 13, 2026 20:45Victor MerckléVictor MerckléScore: 7,711Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 13, 2026 20:457,70272,964,92963,934,00002,117,632stderr
2May 13, 2026 20:457,70371,376,96262,934,0001,005,0002,117,632stderr
3May 13, 2026 20:457,70872,949,22462,976,0001,006,0002,117,632stderr
4May 13, 2026 20:457,70871,332,67462,945,0001,037,0002,117,632stderr
5May 13, 2026 20:457,71171,508,23863,002,0001,007,0002,117,632stderr
6May 13, 2026 20:457,71471,971,20763,024,0001,006,0002,117,632stderr
7May 13, 2026 20:457,71473,803,82563,020,0001,008,0002,117,632stderr
8May 13, 2026 20:457,71474,666,75663,016,0001,017,0002,117,632stderr
9May 13, 2026 20:457,97376,411,22765,177,0001,003,0002,117,632stderr