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 12, 2026 07:03Victor MerckléVictor MerckléScore: 63,432Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 12, 2026 07:0462,43530,630,15623,101,00002,113,536
2Jun 12, 2026 07:0462,58630,906,26223,157,00002,113,536
3Jun 12, 2026 07:0463,11031,011,47523,351,00002,113,536
4Jun 12, 2026 07:0463,35931,144,24223,443,00002,113,536
5Jun 12, 2026 07:0463,43231,101,01023,470,00002,113,536
6Jun 12, 2026 07:0463,45430,931,21623,478,00002,113,536
7Jun 12, 2026 07:0463,50231,049,45223,496,00002,113,536
8Jun 12, 2026 07:0463,78331,279,79323,600,00002,113,536
9Jun 12, 2026 07:0464,13531,391,76423,730,00002,113,536