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 16, 2026 22:18izotoffizotoffScore: 137,684Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 16, 2026 22:18137,39576,921,40548,843,0001,993,0002,396,160
2Mar 16, 2026 22:18137,68480,069,54747,947,0002,996,0002,400,256
3Mar 16, 2026 22:18137,77879,257,99949,979,000999,0002,396,160