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 04:12Dominique GarmierDominique GarmierScore: 73,086Success
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 04:1271,57055,700,18425,463,0001,018,0002,400,256
2Mar 21, 2026 04:1273,08654,313,30925,039,0002,003,0002,273,280
3Mar 21, 2026 04:1273,68449,328,48826,254,0001,009,0002,396,160