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:48Tomislav 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:5056,59729,334,83120,941,000020,480
2Aug 15, 2026 13:5056,60029,328,83520,942,000020,480
3Aug 15, 2026 13:5056,62929,362,77920,953,000020,480
4Aug 15, 2026 13:5056,73729,405,33820,993,000020,480
5Aug 15, 2026 13:5056,74529,438,71220,996,000020,480
6Aug 15, 2026 13:5056,81629,437,97521,022,000020,480
7Aug 15, 2026 13:5056,87229,397,54421,043,000020,480
8Aug 15, 2026 13:5058,22929,896,70421,545,000020,480
9Aug 15, 2026 13:5059,54839,533,64222,033,000020,480