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 17, 2026 22:50Victor MerckléVictor MerckléScore: 63,691Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 17, 2026 22:5162,94030,656,00822,277,0001,011,0002,117,632stderr
2Jun 17, 2026 22:5163,20230,819,39823,385,00002,117,632stderr
3Jun 17, 2026 22:5163,57531,032,98922,507,0001,016,0002,117,632stderr
4Jun 17, 2026 22:5163,60531,082,38123,534,00002,117,632stderr
5Jun 17, 2026 22:5163,69131,018,98923,566,00002,117,632stderr
6Jun 17, 2026 22:5163,70032,271,78523,569,00002,117,632stderr
7Jun 17, 2026 22:5163,70831,470,13822,564,0001,008,0002,117,632stderr
8Jun 17, 2026 22:5163,81331,011,18123,611,00002,117,632stderr
9Jun 17, 2026 22:5163,87831,202,22023,635,00002,117,632stderr