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:12M-RochatM-RochatScore: 59,683Success
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:1459,42136,894,55220,909,0001,077,0002,113,536
2May 18, 2026 18:1459,44332,971,58320,918,0001,076,0002,113,536
3May 18, 2026 18:1459,48633,042,63720,919,0001,091,0002,113,536
4May 18, 2026 18:1459,61633,433,82820,893,0001,165,0002,113,536
5May 18, 2026 18:1459,68332,542,95820,917,0001,166,0002,113,536
6May 18, 2026 18:1459,68931,880,41021,006,0001,079,0002,113,536
7May 18, 2026 18:1459,81333,184,28621,120,0001,011,0002,113,536
8May 18, 2026 18:1459,86231,301,91220,984,0001,165,0002,113,536
9May 18, 2026 18:1459,87534,209,69720,989,0001,165,0002,113,536