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:31izotoffizotoffScore: 115,830Success
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:31115,30568,867,45840,632,0002,031,0002,379,776
2Mar 21, 2026 16:31115,83071,210,46141,861,000996,0002,326,528
3Mar 21, 2026 16:31116,59274,954,69140,130,0003,009,0002,326,528