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 18, 2026 18:38M-RochatM-RochatScore: 59,700Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 18, 2026 18:4059,50234,258,38120,860,0001,156,0002,113,536
2May 18, 2026 18:4059,54833,114,12420,931,0001,102,0002,113,536
3May 18, 2026 18:4059,56732,966,42420,890,0001,150,0002,113,536
4May 18, 2026 18:4059,67032,479,20321,004,0001,074,0002,113,536
5May 18, 2026 18:4059,70031,553,38820,939,0001,150,0002,113,536
6May 18, 2026 18:4059,81633,747,98220,978,0001,154,0002,113,536
7May 18, 2026 18:4059,81633,574,43520,955,0001,177,0002,113,536
8May 18, 2026 18:4059,84532,457,45021,077,0001,066,0002,113,536
9May 18, 2026 18:4060,10832,899,34021,042,0001,198,0002,113,536