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 listAug 15, 2026 13:52Tomislav TunkovicTomislav TunkovicScore: 56,745Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 15, 2026 13:5456,57530,441,19520,933,000020,480
2Aug 15, 2026 13:5456,63229,356,71920,954,000020,480
3Aug 15, 2026 13:5456,68629,416,10820,974,000020,480
4Aug 15, 2026 13:5456,71329,382,54020,984,000020,480
5Aug 15, 2026 13:5456,74529,361,38920,996,000020,480
6Aug 15, 2026 13:5456,81029,384,09121,020,000020,480
7Aug 15, 2026 13:5456,81029,397,83421,020,000020,480
8Aug 15, 2026 13:5456,83229,388,26121,028,000020,480
9Aug 15, 2026 13:5456,86729,459,48721,041,000020,480