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 listFeb 27, 2026 21:01defiancedefianceScore: 370,042Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 27, 2026 21:01368,5883,092,824,1472,982,328,00076,956,0002,285,568
2Feb 27, 2026 21:01369,1993,090,494,9293,000,385,00063,965,0002,289,664
3Feb 27, 2026 21:01369,3823,097,377,7012,994,923,00070,950,0002,359,296
4Feb 27, 2026 21:01369,5323,098,486,4112,997,133,00069,979,0002,285,568
5Feb 27, 2026 21:01370,0423,093,887,8372,990,390,00080,956,0002,285,568
6Feb 27, 2026 21:01370,3383,099,950,5303,008,833,00064,974,0002,293,760
7Feb 27, 2026 21:01370,5553,099,103,5293,015,632,00059,972,0002,285,568
8Feb 27, 2026 21:01370,9853,103,776,9033,013,213,00065,960,0002,355,200
9Feb 27, 2026 21:01372,3013,116,183,9063,026,117,00063,981,0002,285,568