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 18:32Victor MerckléVictor MerckléScore: 70,981Success
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 18:3370,59435,253,99225,015,0001,105,0002,113,536
2Jun 24, 2026 18:3370,75635,258,78025,087,0001,093,0002,113,536
3Jun 24, 2026 18:3370,79736,502,98525,173,0001,022,0002,113,536
4Jun 24, 2026 18:3370,87835,261,76325,202,0001,023,0002,113,536
5Jun 24, 2026 18:3370,98135,404,80325,163,0001,100,0002,113,536
6Jun 24, 2026 18:3371,01635,373,02425,255,0001,021,0002,113,536
7Jun 24, 2026 18:3371,03735,415,43025,254,0001,030,0002,113,536
8Jun 24, 2026 18:3371,06235,467,45525,174,0001,119,0002,113,536
9Jun 24, 2026 18:3371,07835,346,51425,278,0001,021,0002,113,536