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 20:35Victor MerckléVictor MerckléScore: 71,018Success
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 20:3670,85935,366,67424,962,0001,256,0002,113,536
2Jun 24, 2026 20:3670,86735,329,92724,951,0001,270,0002,113,536
3Jun 24, 2026 20:3670,97535,393,88124,997,0001,264,0002,113,536
4Jun 24, 2026 20:3670,98635,308,77025,008,0001,257,0002,113,536
5Jun 24, 2026 20:3671,01835,163,08524,986,0001,291,0002,113,536
6Jun 24, 2026 20:3671,06235,903,14824,998,0001,295,0002,113,536
7Jun 24, 2026 20:3671,15635,390,24025,056,0001,272,0002,113,536
8Jun 24, 2026 20:3671,16735,504,20325,059,0001,273,0002,113,536
9Jun 24, 2026 20:3671,20835,606,04925,065,0001,282,0002,113,536