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 7, 2026 12:05IlyaIlyaScore: 60,205Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 7, 2026 12:0759,98631,928,69721,039,0001,156,0002,113,536
2Jul 7, 2026 12:0760,07231,938,60720,999,0001,228,0002,113,536
3Jul 7, 2026 12:0760,16732,563,92221,043,0001,219,0002,113,536
4Jul 7, 2026 12:0760,17531,967,06621,041,0001,224,0002,113,536
5Jul 7, 2026 12:0760,20531,897,50021,067,0001,209,0002,113,536
6Jul 7, 2026 12:0760,20831,890,64921,072,0001,205,0002,113,536
7Jul 7, 2026 12:0760,27832,051,75421,090,0001,213,0002,113,536
8Jul 7, 2026 12:0760,42131,990,03821,272,0001,084,0002,113,536
9Jul 7, 2026 12:0760,43232,321,29121,118,0001,242,0002,113,536