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 3, 2026 13:31IlyaIlyaScore: 61,535Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 3, 2026 13:3361,23532,194,85121,546,0001,111,0002,113,536
2Jul 3, 2026 13:3361,35932,278,42521,579,0001,124,0002,113,536
3Jul 3, 2026 13:3361,37532,316,80721,525,0001,184,0002,113,536
4Jul 3, 2026 13:3361,45432,683,97121,634,0001,104,0002,113,536
5Jul 3, 2026 13:3361,53532,204,84621,656,0001,112,0002,113,536
6Jul 3, 2026 13:3361,58132,820,31821,598,0001,187,0002,113,536
7Jul 3, 2026 13:3361,83232,930,95821,664,0001,214,0002,113,536
8Jul 3, 2026 13:3361,88632,969,81321,678,0001,220,0002,113,536
9Jul 3, 2026 13:3361,92432,982,20321,690,0001,222,0002,113,536