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 16, 2026 13:58M-RochatM-RochatScore: 73,878Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 16, 2026 13:5973,56435,987,00526,195,0001,024,0002,113,536
2May 16, 2026 13:5973,64037,724,35726,201,0001,046,0002,113,536
3May 16, 2026 13:5973,82736,136,82226,289,0001,027,0002,113,536
4May 16, 2026 13:5973,84037,874,22926,300,0001,021,0002,113,536
5May 16, 2026 13:5973,87837,235,08726,061,0001,274,0002,113,536
6May 16, 2026 13:5973,95637,029,46426,325,0001,039,0002,113,536
7May 16, 2026 13:5974,07838,424,75726,362,0001,047,0002,113,536
8May 16, 2026 13:5974,21636,403,01626,178,0001,282,0002,113,536
9May 16, 2026 13:5974,21836,262,86126,172,0001,289,0002,113,536