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 20:22IlyaIlyaScore: 59,762Success
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 20:2359,48131,454,85720,909,0001,099,0002,113,536
2Jun 29, 2026 20:2359,48631,541,72920,903,0001,107,0002,113,536
3Jun 29, 2026 20:2359,58131,542,14520,923,0001,122,0002,113,536
4Jun 29, 2026 20:2359,72431,509,09820,968,0001,130,0002,117,632
5Jun 29, 2026 20:2359,76231,511,53221,013,0001,099,0002,113,536
6Jun 29, 2026 20:2359,77531,564,72120,940,0001,177,0002,113,536
7Jun 29, 2026 20:2359,83531,538,47621,023,0001,116,0002,113,536
8Jun 29, 2026 20:2359,92432,160,17920,967,0001,205,0002,113,536
9Jun 29, 2026 20:2360,13731,839,54021,014,0001,237,0002,113,536