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 listSep 19, 2026 13:37Andrew EpsteinAndrew EpsteinScore: 383,589Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 19, 2026 14:11383,329152,125,772139,664,0002,168,0002,125,824stderr
2Sep 19, 2026 14:11383,351152,228,013139,681,0002,159,0002,125,824stderr
3Sep 19, 2026 14:11383,391152,196,047139,685,0002,170,0002,125,824stderr
4Sep 19, 2026 14:11383,537152,746,438139,732,0002,177,0002,125,824stderr
5Sep 19, 2026 14:11383,589152,328,947139,755,0002,173,0002,125,824stderr
6Sep 19, 2026 14:11383,797152,353,423139,725,0002,280,0002,125,824stderr
7Sep 19, 2026 14:11383,851152,416,235139,841,0002,184,0002,125,824stderr
8Sep 19, 2026 14:11383,883152,467,386139,859,0002,178,0002,125,824stderr
9Sep 19, 2026 14:11384,013152,460,890139,913,0002,172,0002,125,824stderr