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 16:04Victor MerckléVictor MerckléScore: 62,418Success
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 16:0562,20231,353,16821,993,0001,022,0002,113,536
2Aug 28, 2026 16:0562,24832,028,58422,001,0001,031,0002,113,536
3Aug 28, 2026 16:0562,31031,343,26122,027,0001,028,0002,113,536
4Aug 28, 2026 16:0562,39132,102,52822,052,0001,033,0002,113,536
5Aug 28, 2026 16:0562,41832,204,27022,065,0001,030,0002,113,536
6Aug 28, 2026 16:0562,44531,466,80022,070,0001,035,0002,113,536
7Aug 28, 2026 16:0565,10040,154,98623,038,0001,049,0002,113,536
8Aug 28, 2026 16:0566,40839,339,13323,492,0001,079,0002,113,536
9Aug 28, 2026 16:0567,29437,528,29623,874,0001,025,0002,113,536