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 listMar 3, 2026 22:24olliecrowolliecrowScore: 107,665Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 3, 2026 22:24106,53267,615,34739,417,00002,277,376
2Mar 3, 2026 22:24106,80061,573,60638,503,0001,013,0002,277,376
3Mar 3, 2026 22:24106,81961,224,28138,510,0001,013,0002,523,136
4Mar 3, 2026 22:24107,11166,963,68238,615,0001,016,0002,277,376
5Mar 3, 2026 22:24107,66568,722,10339,836,00002,277,376
6Mar 3, 2026 22:24107,69265,084,14137,854,0001,992,0002,277,376
7Mar 3, 2026 22:24107,72772,244,62438,837,0001,022,0002,277,376
8Mar 3, 2026 22:24108,31466,958,03538,073,0002,003,0002,277,376
9Mar 3, 2026 22:24108,38466,243,20338,097,0002,005,0002,400,256