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 28, 2026 09:44Shikhar SoniShikhar SoniScore: 72,424Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 28, 2026 09:4572,11636,148,66225,641,0001,042,0002,113,536
2Jun 28, 2026 09:4572,25636,608,16025,691,0001,044,0002,113,536
3Jun 28, 2026 09:4572,35636,141,60425,729,0001,043,0002,113,536
4Jun 28, 2026 09:4572,41336,252,68025,749,0001,044,0002,113,536
5Jun 28, 2026 09:4572,42436,694,54325,753,0001,044,0002,113,536
6Jun 28, 2026 09:4572,45637,834,20325,764,0001,045,0002,113,536
7Jun 28, 2026 09:4572,60836,316,53325,820,0001,045,0002,113,536
8Jun 28, 2026 09:4572,71836,809,67125,860,0001,046,0002,113,536
9Jun 28, 2026 09:4572,73536,767,05725,866,0001,046,0002,113,536