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 31, 2026 10:04Victor MerckléVictor MerckléScore: 58,602Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 31, 2026 10:0958,47530,012,77520,411,0001,225,0002,170,880
2Aug 31, 2026 10:0958,56429,996,28620,417,0001,252,0002,129,920
3Aug 31, 2026 10:0958,57230,025,64120,463,0001,209,0002,129,920
4Aug 31, 2026 10:0958,57530,069,48520,400,0001,273,0002,129,920
5Aug 31, 2026 10:0958,60229,907,75520,450,0001,233,0002,129,920
6Aug 31, 2026 10:0958,60530,055,69320,440,0001,244,0002,134,016
7Aug 31, 2026 10:0958,62430,521,77920,445,0001,246,0002,129,920
8Aug 31, 2026 10:0958,67030,225,23320,454,0001,254,0002,170,880
9Aug 31, 2026 10:0958,74830,124,95720,473,0001,264,0002,170,880