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 06:12warshipwarshipScore: 1,815,569Success
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 06:121,811,07015,067,246,82414,974,907,00056,976,0002,277,376
2Dec 4, 2025 06:121,811,08615,064,510,73514,967,036,00064,974,0002,277,376
3Dec 4, 2025 06:121,811,19715,060,133,10114,957,972,00074,964,0002,269,184
4Dec 4, 2025 06:121,811,25815,062,821,31814,962,475,00070,969,0002,289,664
5Dec 4, 2025 06:121,815,56915,096,479,63714,994,259,00074,966,0002,277,376
6Dec 4, 2025 06:121,815,73515,100,881,12615,000,632,00069,970,0002,285,568
7Dec 4, 2025 06:121,818,00315,124,650,65115,025,445,00063,976,0002,285,568
8Dec 4, 2025 06:121,842,17015,329,627,45715,201,050,00088,959,0002,285,568
9Dec 4, 2025 06:121,847,55615,368,892,38815,254,750,00079,967,0002,285,568