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:18M-RochatM-RochatScore: 59,721Success
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:2059,56731,837,42820,881,0001,159,0002,113,536
2May 18, 2026 18:2059,57032,765,55620,886,0001,155,0002,113,536
3May 18, 2026 18:2059,71333,177,19420,914,0001,180,0002,113,536
4May 18, 2026 18:2059,71834,133,11521,025,0001,071,0002,113,536
5May 18, 2026 18:2059,72131,364,24720,916,0001,181,0002,113,536
6May 18, 2026 18:2059,81833,100,73220,979,0001,154,0002,113,536
7May 18, 2026 18:2059,86731,403,20320,970,0001,181,0002,113,536
8May 18, 2026 18:2059,88931,747,77120,996,0001,163,0002,113,536
9May 18, 2026 18:2062,08944,819,17721,915,0001,058,0002,113,536