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 21:02Victor MerckléVictor MerckléScore: 74,018Success
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 21:0373,69436,396,17225,995,0001,272,0002,113,536
2Jun 24, 2026 21:0373,85436,406,88426,074,0001,252,0002,113,536
3Jun 24, 2026 21:0373,92436,503,32526,070,0001,282,0002,113,536
4Jun 24, 2026 21:0374,01336,473,12026,125,0001,260,0002,113,536
5Jun 24, 2026 21:0374,01836,528,54626,113,0001,274,0002,113,536
6Jun 24, 2026 21:0374,03736,523,39326,122,0001,272,0002,113,536
7Jun 24, 2026 21:0374,24336,578,13826,184,0001,286,0002,113,536
8Jun 24, 2026 21:0374,31336,615,03426,209,0001,287,0002,113,536
9Jun 24, 2026 21:0374,35936,594,69826,245,0001,268,0002,113,536