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 listDec 3, 2024 18:02spacecat8086spacecat8086Score: 110,614Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 3, 2024 18:02109,77669,871,15539,602,0001,015,0002,285,568
2Dec 3, 2024 18:02109,89566,371,91839,645,0001,016,0002,285,568
3Dec 3, 2024 18:02110,00869,430,10839,686,0001,017,0002,285,568
4Dec 3, 2024 18:02110,33269,234,01739,828,000995,0002,277,376
5Dec 3, 2024 18:02110,61465,887,96738,931,0001,996,0002,277,376
6Dec 3, 2024 18:02110,65464,860,43338,945,0001,997,0002,265,088
7Dec 3, 2024 18:02110,73565,761,59338,974,0001,998,0002,289,664
8Dec 3, 2024 18:02110,79264,865,15038,994,0001,999,0002,285,568
9Dec 3, 2024 18:02110,89266,970,27239,029,0002,001,0002,277,376