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 11, 2026 11:01Victor MerckléVictor MerckléScore: 63,013Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 11, 2026 11:0362,28630,604,68623,046,00002,113,536
2Jun 11, 2026 11:0362,46230,638,51923,111,00002,113,536
3Jun 11, 2026 11:0362,62930,639,34823,173,00002,113,536
4Jun 11, 2026 11:0362,64030,762,76723,177,00002,113,536
5Jun 11, 2026 11:0363,01330,748,79823,315,00002,113,536
6Jun 11, 2026 11:0363,27830,844,69223,413,00002,113,536
7Jun 11, 2026 11:0363,42131,073,75123,466,00002,113,536
8Jun 11, 2026 11:0363,60231,161,87923,533,00002,113,536
9Jun 11, 2026 11:0364,58131,798,31222,707,0001,188,0002,113,536