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 listApr 21, 2025 17:12Steve BronderSteve BronderScore: 68,846Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 21, 2025 17:1268,37048,694,38424,286,0001,011,0002,433,024
2Apr 21, 2025 17:1268,65746,688,34125,403,00002,273,280
3Apr 21, 2025 17:1268,71646,426,45525,425,00002,535,424
4Apr 21, 2025 17:1268,78449,180,78325,450,00002,441,216
5Apr 21, 2025 17:1268,84643,942,52125,473,00002,510,848
6Apr 21, 2025 17:1268,94646,395,43525,510,00002,437,120
7Apr 21, 2025 17:1269,00845,980,67725,533,00002,428,928
8Apr 21, 2025 17:1269,12459,956,22524,553,0001,023,0002,441,216
9Apr 21, 2025 17:1271,84146,650,29626,581,00002,437,120