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:42Tomislav TunkovicTomislav TunkovicScore: 56,875Success
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:4456,67229,417,27120,969,000020,480
2Aug 15, 2026 13:4456,73529,271,42220,992,000020,480
3Aug 15, 2026 13:4456,75429,890,20820,999,000020,480
4Aug 15, 2026 13:4456,86229,388,28621,039,000020,480
5Aug 15, 2026 13:4456,87529,430,46821,044,000020,480
6Aug 15, 2026 13:4456,88329,408,64821,047,000020,480
7Aug 15, 2026 13:4456,88929,405,73021,049,000020,480
8Aug 15, 2026 13:4456,89129,412,68221,050,000020,480
9Aug 15, 2026 13:4456,95429,442,15921,073,000020,480