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 listJun 21, 2026 22:56A_ShamanA_ShamanScore: 72,397Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 21, 2026 22:5771,76435,788,85525,508,0001,045,0002,113,536
2Jun 21, 2026 22:5772,21636,366,12325,666,0001,054,0002,113,536
3Jun 21, 2026 22:5772,31635,929,90125,703,0001,054,0002,113,536
4Jun 21, 2026 22:5772,35636,251,95825,718,0001,054,0002,113,536
5Jun 21, 2026 22:5772,39736,430,97725,730,0001,057,0002,113,536
6Jun 21, 2026 22:5772,42136,537,91125,742,0001,054,0002,113,536
7Jun 21, 2026 22:5772,59136,083,62125,808,0001,051,0002,113,536
8Jun 21, 2026 22:5772,86736,205,80225,907,0001,054,0002,113,536
9Jun 21, 2026 22:5772,98936,634,86725,950,0001,056,0002,113,536