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 listApr 29, 2026 05:43Charles CabergsCharles CabergsScore: 72,686Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 29, 2026 05:4472,44343,791,77024,819,0001,985,0002,297,856
2Apr 29, 2026 05:4472,54842,595,95824,855,0001,988,0002,359,296
3Apr 29, 2026 05:4472,58344,265,57223,872,0002,984,0002,363,392
4Apr 29, 2026 05:4472,65644,230,11323,896,0002,987,0002,355,200
5Apr 29, 2026 05:4472,68648,264,83124,902,0001,992,0002,363,392
6Apr 29, 2026 05:4472,73547,202,31823,922,0002,990,0002,306,048
7Apr 29, 2026 05:4472,74844,426,80524,924,0001,993,0002,306,048
8Apr 29, 2026 05:4472,75443,231,61023,928,0002,991,0002,363,392
9Apr 29, 2026 05:4472,95143,058,24623,993,0002,999,0002,367,488