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 24, 2025 13:26Daniel MastalerzDaniel MastalerzScore: 2,067,798Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 24, 2025 13:262,063,59417,165,486,15717,060,863,00066,968,0002,277,376
2Sep 24, 2025 13:262,064,53117,170,631,29117,065,644,00069,965,0002,277,376
3Sep 24, 2025 13:262,065,62517,177,811,57517,087,716,00056,969,0002,285,568
4Sep 24, 2025 13:262,066,62217,189,420,32217,074,003,00078,958,0002,289,664
5Sep 24, 2025 13:262,067,79817,196,811,74617,095,757,00066,967,0002,289,664
6Sep 24, 2025 13:262,068,18817,201,552,49217,102,997,00062,966,0002,285,568
7Sep 24, 2025 13:262,068,24317,201,790,61917,096,451,00069,965,0002,277,376
8Sep 24, 2025 13:262,069,30917,214,904,78017,112,297,00062,964,0002,277,376
9Sep 24, 2025 13:262,071,97717,236,140,96517,135,435,00061,972,0002,277,376