TopK Sergey Svistunov

Find the sum of the 100 largest values in a stream of binary integers as fast as possible.

Input: 100 000 000 uint32 values in little-endian binary on STDIN (4 bytes each).

Output: The uint64 sum of the top 100 greatest values, printed as a decimal string.

Back to listFeb 21, 2024 16:08Huy Duc LeHuy Duc LeScore: 93,157Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 21, 2024 16:0892,38457,196,79833,177,0001,005,0002,359,296
2Feb 21, 2024 16:0892,47057,377,62532,202,0002,012,0002,281,472
3Feb 21, 2024 16:0892,58462,156,15932,241,0002,015,0002,281,472
4Feb 21, 2024 16:0893,07357,167,57030,386,0004,051,0002,269,184
5Feb 21, 2024 16:0893,09759,128,08132,420,0002,026,0002,281,472
6Feb 21, 2024 16:0893,13558,748,53933,447,0001,013,0002,535,424
7Feb 21, 2024 16:0893,15762,862,45030,413,0004,055,0002,269,184
8Feb 21, 2024 16:0893,58964,401,34733,610,0001,018,0002,281,472
9Feb 21, 2024 16:0894,21161,223,37433,833,0001,025,0002,281,472
10Feb 21, 2024 16:0895,892121,639,62935,480,01302,277,376
11Feb 21, 2024 16:0897,11996,811,04235,933,98802,277,376
12Feb 21, 2024 16:0897,948100,247,14936,240,93502,269,184