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 25, 2026 00:01Victor MerckléVictor MerckléScore: 68,397Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 25, 2026 00:0168,19734,361,04524,215,0001,018,0002,117,632stderr
2Jun 25, 2026 00:0168,24534,366,33924,231,0001,020,0002,117,632stderr
3Jun 25, 2026 00:0168,26434,338,36624,230,0001,028,0002,117,632stderr
4Jun 25, 2026 00:0168,37834,420,91424,281,0001,019,0002,117,632stderr
5Jun 25, 2026 00:0168,39734,410,61924,297,0001,010,0002,117,632stderr
6Jun 25, 2026 00:0168,42734,387,82024,308,0001,010,0002,117,632stderr
7Jun 25, 2026 00:0168,53534,453,82524,330,0001,028,0002,117,632stderr
8Jun 25, 2026 00:0168,59134,478,34324,346,0001,033,0002,117,632stderr
9Jun 25, 2026 00:0168,64834,529,42324,374,0001,026,0002,117,632stderr