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 listJul 8, 2026 21:36IlyaIlyaScore: 58,632Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 8, 2026 21:3858,39432,338,07920,487,0001,119,0002,113,536
2Jul 8, 2026 21:3858,42431,249,07120,528,0001,089,0002,113,536
3Jul 8, 2026 21:3858,58331,323,75120,563,0001,113,0002,113,536
4Jul 8, 2026 21:3858,60531,341,27920,579,0001,105,0002,113,536
5Jul 8, 2026 21:3858,63231,387,98020,494,0001,200,0002,113,536
6Jul 8, 2026 21:3858,69131,345,76620,594,0001,122,0002,113,536
7Jul 8, 2026 21:3858,77031,349,36020,536,0001,209,0002,113,536
8Jul 8, 2026 21:3858,77231,978,31920,716,0001,030,0002,113,536
9Jul 8, 2026 21:3858,85932,034,56520,573,0001,205,0002,113,536