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 listJun 30, 2026 10:22IlyaIlyaScore: 62,221Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 30, 2026 10:2661,94032,368,16621,807,0001,111,0002,113,536
2Jun 30, 2026 10:2661,95432,424,30921,817,0001,106,0002,113,536
3Jun 30, 2026 10:2662,11832,464,44721,886,0001,098,0002,113,536
4Jun 30, 2026 10:2662,17532,462,75821,898,0001,107,0002,113,536
5Jun 30, 2026 10:2662,22132,895,10821,854,0001,168,0002,113,536
6Jun 30, 2026 10:2662,22432,532,76521,831,0001,192,0002,113,536
7Jun 30, 2026 10:2662,36732,837,21921,797,0001,279,0002,113,536
8Jun 30, 2026 10:2662,41832,998,85121,886,0001,209,0002,113,536
9Jun 30, 2026 10:2662,72432,899,36821,983,0001,225,0002,113,536