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 29, 2026 14:02IlyaIlyaScore: 60,389Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 29, 2026 14:0360,20231,818,76421,159,0001,116,0002,113,536
2Jun 29, 2026 14:0360,20531,784,26721,139,0001,137,0002,113,536
3Jun 29, 2026 14:0360,22731,811,61321,180,0001,104,0002,113,536
4Jun 29, 2026 14:0360,37831,804,71121,224,0001,116,0002,113,536
5Jun 29, 2026 14:0360,38931,780,97121,227,0001,117,0002,113,536
6Jun 29, 2026 14:0360,43533,082,86221,169,0001,192,0002,113,536
7Jun 29, 2026 14:0360,50532,068,42721,195,0001,192,0002,113,536
8Jun 29, 2026 14:0360,69432,343,70921,241,0001,216,0002,113,536
9Jun 29, 2026 14:0360,73732,716,82321,271,0001,202,0002,113,536