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 listMar 20, 2026 16:47olliecrowolliecrowScore: 180,792Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 20, 2026 16:47180,58992,537,36764,824,0001,994,0002,449,408
2Mar 20, 2026 16:47180,79296,523,21264,897,0001,996,0002,326,528
3Mar 20, 2026 16:47180,84993,929,84864,917,0001,997,0002,437,120