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 20:05IlyaIlyaScore: 59,848Success
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 20:0659,45431,450,07620,914,0001,084,0002,113,536
2Jun 29, 2026 20:0659,74531,563,95320,918,0001,188,0002,113,536
3Jun 29, 2026 20:0659,77531,543,39520,916,0001,201,0002,113,536
4Jun 29, 2026 20:0659,83532,849,73521,024,0001,115,0002,113,536
5Jun 29, 2026 20:0659,84832,085,03220,947,0001,197,0002,113,536
6Jun 29, 2026 20:0659,93731,607,28420,961,0001,216,0002,113,536
7Jun 29, 2026 20:0659,96232,104,33020,981,0001,205,0002,113,536
8Jun 29, 2026 20:0660,04831,626,12521,009,0001,209,0002,113,536
9Jun 29, 2026 20:0660,21032,458,32521,059,0001,219,0002,113,536