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 03:27M-RochatM-RochatScore: 61,181Success
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 03:2860,81831,754,67421,426,0001,077,0002,113,536
2May 18, 2026 03:2860,82131,721,46521,424,0001,080,0002,113,536
3May 18, 2026 03:2860,90234,534,18421,457,0001,077,0002,113,536
4May 18, 2026 03:2861,12731,876,20521,545,0001,072,0002,113,536
5May 18, 2026 03:2861,18133,579,89221,465,0001,172,0002,113,536
6May 18, 2026 03:2861,20032,095,42121,564,0001,080,0002,113,536
7May 18, 2026 03:2861,26433,465,33021,585,0001,083,0002,113,536
8May 18, 2026 03:2861,32432,797,04721,565,0001,125,0002,113,536
9May 18, 2026 03:2861,43232,076,75021,678,0001,052,0002,113,536