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 25, 2026 07:39Victor MerckléVictor MerckléScore: 57,108Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 25, 2026 07:4056,95928,585,18220,054,0001,021,0002,113,536
2Jun 25, 2026 07:4056,98628,938,72620,054,0001,031,0002,113,536
3Jun 25, 2026 07:4057,04329,198,27520,071,0001,035,0002,113,536
4Jun 25, 2026 07:4057,04528,602,17620,086,0001,021,0002,113,536
5Jun 25, 2026 07:4057,10828,566,31820,104,0001,026,0002,113,536
6Jun 25, 2026 07:4057,11628,606,20420,095,0001,038,0002,113,536
7Jun 25, 2026 07:4057,27028,838,08120,180,0001,010,0002,113,536
8Jun 25, 2026 07:4057,28628,703,20420,176,0001,020,0002,113,536
9Jun 25, 2026 07:4057,34528,685,91120,206,0001,012,0002,113,536