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 listMay 18, 2026 18:20M-RochatM-RochatScore: 59,667Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 18, 2026 18:2259,45432,900,71520,923,0001,075,0002,113,536
2May 18, 2026 18:2259,54333,506,91020,869,0001,162,0002,113,536
3May 18, 2026 18:2259,58331,273,76120,899,0001,147,0002,113,536
4May 18, 2026 18:2259,64031,312,96320,903,0001,164,0002,113,536
5May 18, 2026 18:2259,66731,260,06520,917,0001,160,0002,113,536
6May 18, 2026 18:2259,67531,600,04820,998,0001,082,0002,113,536
7May 18, 2026 18:2259,69133,131,92420,925,0001,161,0002,113,536
8May 18, 2026 18:2259,88633,239,88921,004,0001,154,0002,113,536
9May 18, 2026 18:2259,91332,232,12320,993,0001,175,0002,113,536