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 listMay 18, 2026 00:54M-RochatM-RochatScore: 60,570Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 18, 2026 00:5760,35132,554,18721,269,0001,061,0002,113,536
2May 18, 2026 00:5760,50231,874,07621,230,0001,156,0002,113,536
3May 18, 2026 00:5760,51633,637,14921,233,0001,158,0002,113,536
4May 18, 2026 00:5760,56434,141,79021,252,0001,157,0002,113,536
5May 18, 2026 00:5760,57033,029,11321,259,0001,152,0002,113,536
6May 18, 2026 00:5760,62931,830,09321,280,0001,153,0002,113,536
7May 18, 2026 00:5760,74834,837,35621,325,0001,152,0002,113,536
8May 18, 2026 00:5760,83732,331,77321,365,0001,145,0002,113,536
9May 18, 2026 00:5760,90532,953,63321,520,0001,015,0002,113,536