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 21, 2026 16:24izotoffizotoffScore: 126,032Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 21, 2026 16:24125,73873,321,85044,501,0002,022,0002,375,680
2Mar 21, 2026 16:24126,03274,537,07545,619,0001,013,0002,359,296
3Mar 21, 2026 16:24126,54374,656,25543,833,0002,988,0002,330,624