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 22:14IlyaIlyaScore: 59,154Success
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 22:1658,87531,256,52120,695,0001,089,0002,113,536
2Jun 30, 2026 22:1658,88131,269,76620,677,0001,109,0002,113,536
3Jun 30, 2026 22:1659,02731,418,71320,701,0001,139,0002,113,536
4Jun 30, 2026 22:1659,11332,703,44620,687,0001,185,0002,113,536
5Jun 30, 2026 22:1659,15431,636,07720,695,0001,192,0002,113,536
6Jun 30, 2026 22:1659,19431,799,46720,712,0001,190,0002,113,536
7Jun 30, 2026 22:1659,38131,965,33420,758,0001,213,0002,113,536
8Jun 30, 2026 22:1659,45631,540,90420,965,0001,034,0002,113,536
9Jun 30, 2026 22:1659,69432,149,63020,814,0001,273,0002,113,536