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 30, 2026 14:34IlyaIlyaScore: 60,243Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 30, 2026 14:3559,92732,946,11421,043,0001,130,0002,113,536
2Jun 30, 2026 14:3559,95131,756,50521,061,0001,121,0002,113,536
3Jun 30, 2026 14:3560,16431,778,51421,068,0001,193,0002,113,536
4Jun 30, 2026 14:3560,20031,758,06921,124,0001,150,0002,113,536
5Jun 30, 2026 14:3560,24332,187,29821,091,0001,199,0002,113,536
6Jun 30, 2026 14:3560,31331,808,16021,140,0001,176,0002,113,536
7Jun 30, 2026 14:3560,34532,244,03921,095,0001,233,0002,113,536
8Jun 30, 2026 14:3560,58132,365,58021,157,0001,258,0002,113,536
9Jun 30, 2026 14:3561,86738,717,74721,661,0001,230,0002,113,536