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 21, 2026 18:56M-RochatM-RochatScore: 59,443Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 21, 2026 18:5759,31333,962,18720,877,0001,069,0002,113,536
2May 21, 2026 18:5759,34531,233,52420,887,0001,071,0002,113,536
3May 21, 2026 18:5759,38932,214,28720,898,0001,076,0002,113,536
4May 21, 2026 18:5759,44032,148,53420,921,0001,072,0002,113,536
5May 21, 2026 18:5759,44333,115,66820,932,0001,062,0002,113,536
6May 21, 2026 18:5759,52931,537,92120,954,0001,072,0002,113,536
7May 21, 2026 18:5759,60231,604,53620,886,0001,167,0002,113,536
8May 21, 2026 18:5759,81633,912,88820,979,0001,153,0002,113,536
9May 21, 2026 18:5759,82733,419,85320,962,0001,174,0002,113,536