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 17, 2025 00:38Ian MckibbenIan MckibbenScore: 114,143Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 17, 2025 00:38113,30566,510,91439,927,0001,996,0002,289,664
2Jan 17, 2025 00:38113,47072,761,73039,985,0001,999,0002,289,664
3Jan 17, 2025 00:38113,82771,040,61940,111,0002,005,0002,289,664
4Jan 17, 2025 00:38113,99768,361,52842,179,00002,269,184
5Jan 17, 2025 00:38114,14368,621,46741,228,0001,005,0002,289,664
6Jan 17, 2025 00:38114,45468,273,83540,332,0002,016,0002,289,664
7Jan 17, 2025 00:38114,51464,485,60340,353,0002,017,0002,289,664
8Jan 17, 2025 00:38115,02264,136,69141,545,0001,013,0002,273,280
9Jan 17, 2025 00:38115,15468,974,51841,593,0001,014,0002,289,664