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 listJan 12, 2026 04:38Josu San MartinJosu San MartinScore: 71,846Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 12, 2026 04:3871,76258,119,63126,552,00002,359,296
2Jan 12, 2026 04:3971,80551,227,24926,568,00002,371,584
3Jan 12, 2026 04:3971,84352,457,48626,582,00002,289,664
4Jan 12, 2026 04:3871,84652,381,67526,583,00002,363,392
5Jan 12, 2026 04:3971,87854,219,49926,595,00002,367,488
6Jan 12, 2026 04:3872,10352,123,24925,652,0001,026,0002,486,272