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 listDec 4, 2025 05:18warshipwarshipScore: 2,066,142Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 4, 2025 05:182,064,33617,164,376,90217,069,012,00064,973,0002,277,376
2Dec 4, 2025 05:182,064,58917,169,576,37517,070,115,00065,973,0002,269,184
3Dec 4, 2025 05:182,064,59317,173,821,18617,060,159,00075,960,0002,285,568
4Dec 4, 2025 05:182,065,08317,170,820,89117,070,216,00069,972,0002,277,376
5Dec 4, 2025 05:182,066,14217,180,134,97417,081,004,00067,972,0002,277,376
6Dec 4, 2025 05:182,066,42517,183,548,22217,098,352,00052,976,0002,289,664
7Dec 4, 2025 05:182,071,97517,230,807,12417,130,419,00066,970,0002,277,376
8Dec 4, 2025 05:182,081,25817,308,000,38317,199,477,00074,962,0002,277,376
9Dec 4, 2025 05:182,088,64717,371,407,68917,271,799,00063,969,0002,289,664