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 19:22IlyaIlyaScore: 59,900Success
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 19:2359,71032,781,82820,933,0001,160,0002,113,536
2Jun 29, 2026 19:2359,75931,597,17820,899,0001,212,0002,113,536
3Jun 29, 2026 19:2359,85931,594,67720,946,0001,202,0002,113,536
4Jun 29, 2026 19:2359,89432,054,82720,980,0001,181,0002,113,536
5Jun 29, 2026 19:2359,90031,615,63321,042,0001,121,0002,113,536
6Jun 29, 2026 19:2359,91832,064,84220,960,0001,210,0002,113,536
7Jun 29, 2026 19:2360,01632,232,47120,987,0001,219,0002,113,536
8Jun 29, 2026 19:2360,04831,625,48921,030,0001,188,0002,113,536
9Jun 29, 2026 19:2360,22132,496,06121,059,0001,223,0002,113,536