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:38Dominique GarmierDominique GarmierScore: 71,273Success
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:3871,13558,378,76424,296,0002,024,0002,273,280
2Mar 15, 2026 22:3871,27350,555,82524,343,0002,028,0002,273,280
3Mar 15, 2026 22:3871,77050,731,00625,534,0001,021,0002,392,064