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 23, 2026 16:45Dominique GarmierDominique GarmierScore: 70,203Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 23, 2026 16:4569,96552,261,72024,892,000995,0002,281,472
2Mar 23, 2026 07:0270,11453,977,49524,945,000997,0002,400,256
3Mar 23, 2026 07:0270,15952,597,89223,963,0001,996,0002,281,472
4Mar 23, 2026 16:4570,20353,722,49924,976,000999,0002,281,472
5Mar 23, 2026 07:0270,27356,474,27425,001,0001,000,0002,400,256
6Mar 23, 2026 16:4570,67353,842,20125,144,0001,005,0002,273,280