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 listAug 18, 2025 07:30Ahmed MhedhbiAhmed MhedhbiScore: 368,565Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 18, 2025 07:30368,1993,087,423,7362,988,099,00067,956,0002,506,752
2Aug 18, 2025 07:30368,4783,081,772,1552,991,400,00066,964,0002,359,296
3Aug 18, 2025 07:30368,5113,081,387,4232,994,669,00063,971,0002,289,664
4Aug 18, 2025 07:30368,5223,086,584,1942,992,761,00065,972,0002,289,664
5Aug 18, 2025 07:30368,5653,087,880,0312,977,112,00081,975,0002,281,472
6Aug 18, 2025 07:30368,5683,092,553,3882,987,132,00071,979,0002,506,752
7Aug 18, 2025 07:30368,6993,087,532,8092,976,249,00083,950,0002,281,472
8Aug 18, 2025 07:30368,7943,088,588,6052,992,034,00068,954,0002,289,664
9Aug 18, 2025 07:30369,0303,089,484,9342,996,995,00065,955,0002,510,848