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, 2026 01:22Victor MerckléVictor MerckléScore: 63,978Success
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, 2026 01:2363,85634,107,73022,568,0001,059,0002,113,536
2Jun 8, 2026 01:2363,86432,672,22222,495,0001,135,0002,113,536
3Jun 8, 2026 01:2363,87532,725,92722,584,0001,050,0002,113,536
4Jun 8, 2026 01:2363,94832,726,12222,538,0001,123,0002,113,536
5Jun 8, 2026 01:2363,97832,797,07122,534,0001,138,0002,113,536
6Jun 8, 2026 01:2364,13732,852,40922,587,0001,144,0002,113,536
7Jun 8, 2026 01:2364,25632,880,45022,700,0001,075,0002,113,536
8Jun 8, 2026 01:2364,50532,989,87122,707,0001,160,0002,113,536
9Jun 8, 2026 01:2364,56433,430,72322,733,0001,156,0002,113,536