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 18, 2026 15:52Victor MerckléVictor MerckléScore: 63,654Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 18, 2026 15:5362,49430,736,16723,123,00002,113,536
2Jun 18, 2026 15:5362,54030,579,79923,140,00002,113,536
3Jun 18, 2026 15:5362,91630,683,63823,279,00002,113,536
4Jun 18, 2026 15:5363,30032,317,53823,421,00002,113,536
5Jun 18, 2026 15:5363,65431,010,11023,552,00002,113,536
6Jun 18, 2026 15:5363,71030,979,51522,530,0001,043,0002,113,536
7Jun 18, 2026 15:5364,08931,106,89823,713,00002,113,536
8Jun 18, 2026 15:53121,25652,852,22344,865,00002,113,536
9Jun 18, 2026 15:53121,49152,653,50744,952,00002,113,536