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 18:52Victor MerckléVictor MerckléScore: 77,078Success
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 18:5376,60037,558,03527,258,0001,084,0002,113,536
2Jun 24, 2026 18:5376,64337,536,58227,248,0001,110,0002,113,536
3Jun 24, 2026 18:5376,89137,479,11827,362,0001,088,0002,113,536
4Jun 24, 2026 18:5377,05637,674,00627,488,0001,023,0002,113,536
5Jun 24, 2026 18:5377,07837,692,69027,404,0001,115,0002,113,536
6Jun 24, 2026 18:5377,17037,711,70227,447,0001,106,0002,113,536
7Jun 24, 2026 18:5377,23737,725,13927,472,0001,106,0002,113,536
8Jun 24, 2026 18:5377,24537,688,58627,463,0001,118,0002,113,536
9Jun 24, 2026 18:5377,46237,833,80927,637,0001,024,0002,113,536