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 27, 2024 17:01Drew GarciaDrew GarciaScore: 60,101Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 27, 2024 17:0160,074534,242,023495,620,0002,997,0002,269,184
2Sep 27, 2024 17:0160,077528,277,102498,643,00002,396,160
3Sep 27, 2024 17:0160,086525,957,372496,719,0001,998,0002,400,256
4Sep 27, 2024 17:0160,098531,009,699496,815,0001,999,0002,269,184
5Sep 27, 2024 17:0160,101527,176,893495,836,0002,999,0002,400,256
6Sep 27, 2024 17:0160,103529,513,433497,856,000999,0002,396,160
7Sep 27, 2024 17:0160,106523,662,552496,881,0001,999,0002,269,184
8Sep 27, 2024 17:0160,108531,708,508495,900,0002,999,0002,392,064
9Sep 27, 2024 17:0160,118525,811,264496,982,0001,999,0002,269,184