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 listApr 24, 2026 22:40Charles CabergsCharles CabergsScore: 70,991Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 24, 2026 22:4170,87841,767,63824,208,0002,017,0002,359,296
2Apr 24, 2026 22:4170,92943,083,87124,226,0002,018,0002,371,584
3Apr 24, 2026 22:4170,94540,880,16724,231,0002,019,0002,359,296
4Apr 24, 2026 22:4170,98645,302,62024,245,0002,020,0002,301,952
5Apr 24, 2026 22:4170,99143,413,45524,247,0002,020,0002,306,048
6Apr 24, 2026 22:4171,10842,352,31325,299,0001,011,0002,301,952
7Apr 24, 2026 22:4171,13544,894,32025,308,0001,012,0002,363,392
8Apr 24, 2026 22:4171,23542,135,27625,344,0001,013,0002,433,024
9Apr 24, 2026 22:4171,31040,827,80125,371,0001,014,0002,351,104