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 listJun 8, 2024 13:47Joad NacerJoad NacerScore: 67,159Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 8, 2024 13:4766,55949,550,08123,601,0001,026,0002,289,664
2Jun 8, 2024 13:4766,64151,301,74024,657,00002,269,184
3Jun 8, 2024 13:4766,68451,453,37123,645,0001,028,0002,273,280
4Jun 8, 2024 13:4767,13853,722,59822,854,0001,987,0002,289,664
5Jun 8, 2024 13:4767,14351,142,08123,850,000993,0002,289,664
6Jun 8, 2024 13:4767,15453,324,08523,854,000993,0002,269,184
7Jun 8, 2024 13:4767,15955,552,07824,849,00002,289,664
8Jun 8, 2024 13:4767,24149,940,50523,884,000995,0002,277,376
9Jun 8, 2024 13:4767,27650,910,18722,901,0001,991,0002,289,664
10Jun 8, 2024 13:4771,233118,234,00926,356,19302,269,184
11Jun 8, 2024 13:4771,30989,141,47826,384,22202,273,280
12Jun 8, 2024 13:4771,630101,199,82526,502,96302,256,896