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 listApr 9, 2026 18:09olliecrowolliecrowScore: 70,881Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 9, 2026 18:0968,11451,861,46022,178,0003,024,0002,433,024
2Apr 9, 2026 18:0970,88151,727,88723,200,0003,026,0002,314,240
3Apr 9, 2026 18:0971,17860,523,47124,311,0002,025,0002,326,528