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 10, 2026 18:39Victor MerckléVictor MerckléScore: 65,691Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 10, 2026 18:4065,09731,590,79324,086,00002,113,536
2Jun 10, 2026 18:4065,55131,646,40424,254,00002,113,536
3Jun 10, 2026 18:4065,59131,753,45424,269,00002,113,536
4Jun 10, 2026 18:4065,65431,970,65924,292,00002,113,536
5Jun 10, 2026 18:4065,69131,746,88424,306,00002,113,536
6Jun 10, 2026 18:4065,71832,284,85124,316,00002,113,536
7Jun 10, 2026 18:4065,72732,085,34724,319,00002,113,536
8Jun 10, 2026 18:4065,72932,101,25024,320,00002,113,536
9Jun 10, 2026 18:4065,75931,746,27424,331,00002,113,536