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 08:32M-RochatM-RochatScore: 59,970Success
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 08:3359,80031,607,32220,978,0001,148,0002,113,536
2May 18, 2026 08:3359,81832,361,34820,984,0001,149,0002,113,536
3May 18, 2026 08:3359,87031,350,60220,997,0001,155,0002,113,536
4May 18, 2026 08:3359,88334,241,20321,008,0001,149,0002,113,536
5May 18, 2026 08:3359,97031,861,25821,047,0001,142,0002,113,536
6May 18, 2026 08:3360,02433,144,79421,055,0001,154,0002,113,536
7May 18, 2026 08:3360,04531,955,65021,078,0001,139,0002,113,536
8May 18, 2026 08:3360,05933,341,89421,072,0001,150,0002,113,536
9May 18, 2026 08:3360,09134,489,83121,093,0001,141,0002,113,536