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 4, 2024 09:58ErnKiewErnKiewScore: 141,287Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 4, 2024 09:58141,2341,196,361,2201,097,294,00074,951,0002,281,472
2Sep 4, 2024 09:58141,2501,195,078,8611,091,420,00080,956,0002,281,472
3Sep 4, 2024 09:58141,2701,195,435,3011,102,569,00069,972,0002,281,472
4Sep 4, 2024 09:58141,2871,197,553,4441,094,701,00077,978,0002,281,472
5Sep 4, 2024 09:58141,2871,194,195,2681,096,703,00075,979,0002,277,376
6Sep 4, 2024 09:58141,3061,198,303,7161,093,853,00078,989,0002,273,280
7Sep 4, 2024 09:58141,3161,202,793,0911,089,931,00082,994,0002,281,472
8Sep 4, 2024 09:58141,3361,196,491,3261,101,084,00072,005,0002,281,472
9Sep 4, 2024 09:58141,3401,198,635,4751,093,186,00079,940,0002,281,472