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 24, 2026 23:43Victor MerckléVictor MerckléScore: 69,962Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 24, 2026 23:4469,66233,214,22024,753,0001,022,0002,113,536
2Jun 24, 2026 23:4469,75633,256,48225,810,00002,113,536
3Jun 24, 2026 23:4469,80833,519,00624,822,0001,007,0002,113,536
4Jun 24, 2026 23:4469,94533,525,61824,836,0001,044,0002,113,536
5Jun 24, 2026 23:4469,96233,696,23624,871,0001,015,0002,113,536
6Jun 24, 2026 23:4470,18134,060,40624,964,0001,003,0002,113,536
7Jun 24, 2026 23:4470,18333,998,79724,920,0001,048,0002,113,536
8Jun 24, 2026 23:4470,24033,836,67024,974,0001,015,0002,113,536
9Jun 24, 2026 23:44630,989241,501,532232,419,0001,047,0002,113,536