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 30, 2026 10:05Dominique GarmierDominique GarmierScore: 97,078Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 30, 2026 10:0597,03566,032,54034,906,000997,0002,355,200
2Mar 30, 2026 10:0597,07864,919,34833,924,0001,995,0002,355,200
3Mar 30, 2026 10:0597,92457,177,74234,220,0002,012,0002,359,296