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 listOct 9, 2024 00:38ygglooygglooScore: 691,261Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 9, 2024 00:38690,6065,765,764,6285,634,100,00097,932,0002,314,240
2Oct 9, 2024 00:38690,8015,765,394,8545,634,703,00098,942,0002,338,816
3Oct 9, 2024 00:38690,9415,762,487,8365,653,873,00080,940,0002,375,680
4Oct 9, 2024 00:38690,9825,771,420,4215,655,219,00079,932,0002,531,328
5Oct 9, 2024 00:38691,2615,771,581,9085,650,521,00086,946,0002,400,256
6Oct 9, 2024 00:38691,7025,777,041,6535,663,164,00077,960,0002,486,272
7Oct 9, 2024 00:38691,7415,777,725,4575,656,515,00084,932,0002,486,272
8Oct 9, 2024 00:38692,2495,778,162,9055,661,715,00083,951,0002,408,448
9Oct 9, 2024 00:38692,3935,779,208,3845,651,943,00094,915,0002,473,984