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 5, 2026 13:09Victor MerckléVictor MerckléScore: 64,497Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 5, 2026 13:1064,10532,806,70322,671,0001,048,0002,113,536
2Jun 5, 2026 13:1064,20233,058,02822,586,0001,169,0002,113,536
3Jun 5, 2026 13:1064,33732,895,66122,656,0001,149,0002,113,536
4Jun 5, 2026 13:1064,35932,905,99022,680,0001,133,0002,113,536
5Jun 5, 2026 13:1064,49732,965,21622,731,0001,133,0002,113,536
6Jun 5, 2026 13:1064,50032,933,94822,735,0001,130,0002,113,536
7Jun 5, 2026 13:1064,62433,009,65722,854,0001,057,0002,113,536
8Jun 5, 2026 13:1064,88933,073,85822,872,0001,137,0002,113,536
9Jun 5, 2026 13:1064,91033,094,01622,873,0001,144,0002,113,536