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 listJan 28, 2025 09:40Oleg KovalovOleg KovalovScore: 212,262Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 28, 2025 09:40211,97899,171,83177,427,0001,005,0002,478,080
2Jan 28, 2025 09:40212,184100,448,55378,508,00002,330,624
3Jan 28, 2025 09:40212,195100,235,31478,512,00002,482,176
4Jan 28, 2025 09:40212,208103,539,16978,517,00002,486,272
5Jan 28, 2025 09:40212,26299,871,37977,531,0001,006,0002,482,176
6Jan 28, 2025 09:40212,311102,512,08277,548,0001,007,0002,486,272
7Jan 28, 2025 09:40212,435108,264,78078,601,00002,482,176
8Jan 28, 2025 09:40212,505111,821,48678,627,00002,482,176
9Jan 28, 2025 09:40212,546107,726,31276,626,0002,016,0002,330,624