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:36Tomislav TunkovicTomislav TunkovicScore: 56,748Success
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:3756,64329,374,41920,958,000020,480
2Aug 15, 2026 13:3756,65629,403,97320,963,000020,480
3Aug 15, 2026 13:3756,66229,377,33720,965,000020,480
4Aug 15, 2026 13:3756,71329,367,78420,984,000020,480
5Aug 15, 2026 13:3756,74829,418,95520,997,000020,480
6Aug 15, 2026 13:3756,76729,351,55221,004,000020,480
7Aug 15, 2026 13:3756,90529,448,02621,055,000020,480
8Aug 15, 2026 13:3756,92929,427,70321,064,000020,480
9Aug 15, 2026 13:3756,93529,513,86621,066,000020,480