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 8, 2025 16:24Dmytro OvcharenkoDmytro OvcharenkoScore: 523,932Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 8, 2025 16:24521,5584,354,697,1074,248,968,00079,961,0002,273,280
2May 8, 2025 16:24522,2504,357,756,3064,266,714,00067,963,0002,273,280
3May 8, 2025 16:24522,4164,360,970,3724,278,080,00057,973,0002,285,568
4May 8, 2025 16:24523,1344,371,251,9724,273,046,00068,968,0002,273,280
5May 8, 2025 16:24523,9324,376,275,3454,274,680,00073,959,0002,375,680
6May 8, 2025 16:24524,0804,378,807,1174,268,900,00080,960,0002,379,776
7May 8, 2025 16:24524,1194,384,705,0824,293,209,00056,976,0002,383,872
8May 8, 2025 16:24524,1514,380,696,4214,286,495,00063,962,0002,285,568
9May 8, 2025 16:24531,5694,436,730,0484,348,050,00063,971,0002,375,680