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 15, 2026 22:48Dominique GarmierDominique GarmierScore: 70,827Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 15, 2026 22:4870,78652,402,30925,184,0001,007,0002,273,280
2Mar 15, 2026 22:4870,82752,874,86024,191,0002,015,0002,273,280
3Mar 15, 2026 22:4871,24152,824,89525,346,0001,013,0002,273,280