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 listSep 8, 2026 12:51Victor MerckléVictor MerckléScore: 4,230Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 8, 2026 12:563,99042,183,85129,992,0003,131,0002,117,632stderr
2Sep 8, 2026 12:564,02242,525,51630,316,0003,067,0002,117,632stderr
3Sep 8, 2026 12:564,03042,004,89431,402,0002,049,00024,576stderr
4Sep 8, 2026 12:564,20044,029,92730,207,0004,655,00024,576stderr
5Sep 8, 2026 12:564,23044,284,51730,097,0005,015,00024,576stderr
6Sep 8, 2026 12:564,23244,379,50030,202,0004,931,00024,576stderr
7Sep 8, 2026 12:564,32444,341,81830,134,0005,763,0002,117,632stderr
8Sep 8, 2026 12:564,38745,562,94230,423,0005,994,0002,117,632stderr
9Sep 8, 2026 12:564,40045,633,89130,381,0006,144,0002,117,632stderr