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 listJan 19, 2025 09:10Ian MckibbenIan MckibbenScore: 71,165Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 19, 2025 09:1070,73847,588,71725,167,0001,006,0002,433,024
2Jan 19, 2025 09:1070,75155,813,03925,172,0001,006,0002,531,328
3Jan 19, 2025 09:1070,81453,457,97825,194,0001,007,0002,428,928
4Jan 19, 2025 09:1071,16249,268,53326,330,00002,510,848
5Jan 19, 2025 09:1071,16551,113,52125,319,0001,012,0002,424,832
6Jan 19, 2025 09:1071,24650,327,16726,361,00002,428,928
7Jan 19, 2025 09:1071,28945,709,95626,377,00002,531,328
8Jan 19, 2025 09:1071,40348,746,96626,419,00002,433,024
9Jan 19, 2025 09:1071,51451,481,14225,443,0001,017,0002,437,120