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 listAug 16, 2026 23:14Tomislav TunkovicTomislav TunkovicScore: 56,935Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 17, 2026 05:2956,81629,157,82421,022,000020,480
2Aug 17, 2026 05:2956,84329,211,52921,032,000020,480
3Aug 17, 2026 05:2956,86430,704,46621,040,000020,480
4Aug 17, 2026 05:2956,88929,211,41221,049,000020,480
5Aug 17, 2026 05:2956,93529,065,92621,066,000020,480
6Aug 17, 2026 05:2957,02429,521,25121,099,000020,480
7Aug 17, 2026 05:2957,10029,716,33321,127,000020,480
8Aug 17, 2026 05:2957,14029,298,51421,142,000020,480
9Aug 17, 2026 05:2957,69129,523,95421,346,000020,480