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 25, 2025 06:42Wookyung JeongWookyung JeongScore: 2,070,724Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 25, 2025 06:422,067,70117,192,701,84317,089,954,00071,966,0002,277,376
2Sep 25, 2025 06:422,068,31817,200,375,61017,106,070,00060,968,0002,260,992
3Sep 25, 2025 06:422,068,54317,197,180,32017,103,935,00064,969,0002,285,568
4Sep 25, 2025 06:422,069,70017,215,067,99817,099,546,00078,960,0002,277,376
5Sep 25, 2025 06:422,070,72417,221,517,45217,121,037,00065,969,0002,265,088
6Sep 25, 2025 06:422,071,13817,222,999,72117,113,482,00076,961,0002,277,376
7Sep 25, 2025 06:422,081,27817,308,989,36917,218,637,00055,969,0002,519,040
8Sep 25, 2025 06:422,082,63417,317,800,00317,221,892,00063,969,0002,277,376
9Sep 25, 2025 06:422,112,77917,567,846,62917,468,108,00067,961,0002,289,664