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 listAug 28, 2026 17:03Victor MerckléVictor MerckléScore: 64,027Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 28, 2026 17:0463,91332,772,10622,616,0001,032,0002,113,536
2Aug 28, 2026 17:0463,92431,782,05422,624,0001,028,0002,113,536
3Aug 28, 2026 17:0463,96732,674,75422,634,0001,034,0002,113,536
4Aug 28, 2026 17:0463,97032,026,79022,652,0001,017,0002,113,536
5Aug 28, 2026 17:0464,02732,731,90822,666,0001,024,0002,113,536
6Aug 28, 2026 17:0464,05931,890,72522,701,0001,001,0002,113,536
7Aug 28, 2026 17:0464,18332,773,54922,721,0001,027,0002,113,536
8Aug 28, 2026 17:0464,19432,828,30122,740,0001,012,0002,113,536
9Aug 28, 2026 17:0464,21031,946,09122,722,0001,036,0002,113,536