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 7, 2024 21:31Lickety SplitLickety SplitScore: 109,635Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 7, 2024 21:31109,624933,008,628896,885,00012,998,0002,359,296
2Oct 7, 2024 21:32109,629933,323,173891,923,00017,998,0002,498,560
3Oct 7, 2024 21:32109,635933,924,645896,969,00012,999,0002,355,200
4Oct 7, 2024 21:32109,635943,232,768888,975,00020,999,0002,359,296
5Oct 7, 2024 21:31109,685936,712,685890,396,00019,986,0002,355,200
6Oct 7, 2024 21:31109,685937,753,861894,398,00015,989,0002,355,200