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 4, 2026 02:44Josu San MartinJosu San MartinScore: 71,143Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 4, 2026 02:4471,09750,234,54623,271,0003,035,0002,314,240
2Mar 4, 2026 02:4471,14350,428,89624,299,0002,024,0002,310,144
3Mar 4, 2026 02:4472,10350,817,26525,652,0001,026,0002,334,720