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 16, 2026 06:50olliecrowolliecrowScore: 61,038Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 16, 2026 06:5060,83846,614,81722,510,00002,289,664
2Apr 16, 2026 06:5061,03850,105,84922,584,00002,379,776
3Apr 16, 2026 06:5061,24652,394,32121,631,0001,030,0002,289,664