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 listJul 15, 2025 02:13Steve BronderSteve BronderScore: 63,205Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 15, 2025 02:1362,93249,434,47622,273,0001,012,0002,433,024
2Jul 15, 2025 02:2363,07345,962,80122,323,0001,014,0002,539,520
3Jul 15, 2025 02:2363,16243,178,68122,354,0001,016,0002,428,928
4Jul 15, 2025 02:1363,20548,474,66221,353,0002,033,0002,433,024
5Jul 15, 2025 02:1363,38647,205,80422,434,0001,019,0002,437,120
6Jul 15, 2025 02:2363,67045,670,83023,558,00002,433,024