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 listMay 17, 2026 08:31M-RochatM-RochatScore: 67,194Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 17, 2026 08:3266,80535,473,35423,698,0001,020,0002,113,536
2May 17, 2026 08:3266,92433,488,57523,743,0001,019,0002,113,536
3May 17, 2026 08:3267,15435,755,90123,838,0001,009,0002,113,536
4May 17, 2026 08:3267,15936,312,45123,831,0001,018,0002,113,536
5May 17, 2026 08:3267,19436,385,62423,850,0001,012,0002,113,536
6May 17, 2026 08:3267,26735,704,95123,865,0001,024,0002,113,536
7May 17, 2026 08:3267,27234,929,83723,874,0001,017,0002,113,536
8May 17, 2026 08:3267,52733,782,72923,963,0001,022,0002,113,536
9May 17, 2026 08:3267,80535,363,82523,954,0001,134,0002,113,536