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 listMay 12, 2025 13:23Roald OngRoald OngScore: 2,065,891Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 12, 2025 13:232,063,90317,161,247,48017,064,425,00065,970,0002,277,376
2May 12, 2025 13:232,064,21817,164,711,76017,072,036,00060,975,0002,383,872
3May 12, 2025 13:232,064,32317,164,913,34217,062,915,00070,970,0002,285,568
4May 12, 2025 13:232,065,45617,175,800,02217,067,311,00075,970,0002,277,376
5May 12, 2025 13:232,065,89117,180,330,99117,085,919,00060,974,0002,289,664
6May 12, 2025 13:232,066,01517,181,713,43917,079,955,00067,967,0002,289,664
7May 12, 2025 13:232,068,78217,204,483,53017,113,915,00056,976,0002,260,992
8May 12, 2025 13:232,072,32117,232,411,67217,132,294,00067,969,0002,277,376
9May 12, 2025 13:232,123,03817,651,072,39617,558,239,00062,975,0002,277,376