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:25IlyaIlyaScore: 61,118Success
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:2760,81831,999,28621,397,0001,106,0002,113,536
2Jun 29, 2026 14:2760,93232,067,97521,443,0001,102,0002,113,536
3Jun 29, 2026 14:2760,97832,007,81621,335,0001,227,0002,113,536
4Jun 29, 2026 14:2761,10232,611,44321,427,0001,181,0002,113,536
5Jun 29, 2026 14:2761,11832,117,93921,415,0001,199,0002,113,536
6Jun 29, 2026 14:2761,35932,662,70021,488,0001,215,0002,113,536
7Jun 29, 2026 14:2761,50532,929,62721,687,0001,070,0002,113,536
8Jun 29, 2026 14:2762,03538,851,26921,926,0001,027,0002,113,536
9Jun 29, 2026 14:2764,65946,544,16622,663,0001,261,0002,113,536