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 listMar 20, 2026 16:54olliecrowolliecrowScore: 111,357Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 20, 2026 16:53110,85168,356,87939,015,0002,000,0002,306,048
2Mar 20, 2026 16:54110,91665,373,66438,037,0003,002,0002,449,408
3Mar 20, 2026 16:53111,12469,094,60938,108,0003,008,0002,338,816
4Mar 20, 2026 16:54111,35763,308,90139,193,0002,009,0002,334,720
5Mar 20, 2026 16:54111,89569,062,34439,382,0002,019,0002,441,216
6Mar 20, 2026 16:53112,14664,968,90738,458,0003,036,0002,326,528