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 10:39Victor MerckléVictor MerckléScore: 63,351Success
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 10:4062,57230,606,03423,152,00002,113,536
2Jun 24, 2026 10:4062,92130,689,34123,281,00002,113,536
3Jun 24, 2026 10:4062,94330,734,03623,289,00002,113,536
4Jun 24, 2026 10:4063,01630,762,05923,316,00002,113,536
5Jun 24, 2026 10:4063,35131,486,44323,440,00002,113,536
6Jun 24, 2026 10:4063,76431,063,67323,593,00002,113,536
7Jun 24, 2026 10:4063,80031,727,70723,606,00002,113,536
8Jun 24, 2026 10:4063,89431,085,12423,641,00002,113,536
9Jun 24, 2026 10:4064,04331,208,92523,696,00002,113,536