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 06:42Victor MerckléVictor MerckléScore: 63,054Success
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 06:4362,83230,883,69523,248,00002,113,536
2Jun 12, 2026 06:4362,84330,738,41423,252,00002,113,536
3Jun 12, 2026 06:4362,87830,763,86923,265,00002,113,536
4Jun 12, 2026 06:4363,00530,831,39823,312,00002,113,536
5Jun 12, 2026 06:4363,05430,825,23423,330,00002,113,536
6Jun 12, 2026 06:4363,45631,044,30623,479,00002,113,536
7Jun 12, 2026 06:4363,46430,980,56123,482,00002,113,536
8Jun 12, 2026 06:4364,13531,203,81923,730,00002,113,536
9Jun 12, 2026 06:43150,69763,256,41055,758,00002,113,536