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 4, 2024 15:28Andrew AshworthAndrew AshworthScore: 1,826,687Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 4, 2024 15:281,825,20815,178,088,57015,087,252,00061,976,0002,293,760
2Oct 4, 2024 15:281,825,34315,187,438,57315,073,377,00076,971,0002,281,472
3Oct 4, 2024 15:281,826,06515,188,252,14215,090,372,00065,971,0002,269,184
4Oct 4, 2024 15:281,826,06715,183,324,06615,098,381,00057,978,0002,289,664
5Oct 4, 2024 15:281,826,68715,201,849,32215,100,527,00060,973,0002,281,472
6Oct 4, 2024 15:281,829,82315,216,765,43015,138,552,00048,979,0002,281,472
7Oct 4, 2024 15:281,830,70115,226,389,77515,117,858,00076,963,0002,293,760
8Oct 4, 2024 15:281,831,04415,226,817,58715,133,692,00063,973,0002,289,664
9Oct 4, 2024 15:281,833,80915,255,809,85215,152,645,00067,971,0002,281,472