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 listAug 27, 2023 22:08Franek KortaFranek KortaScore: 72,708Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 27, 2023 22:0872,15750,602,01425,672,0001,026,0002,531,328
2Aug 27, 2023 22:0872,22255,175,49226,722,00002,441,216
3Aug 27, 2023 22:0872,35157,611,20423,796,0002,974,0002,441,216
4Aug 27, 2023 22:0872,57651,449,60225,859,000994,0002,531,328
5Aug 27, 2023 22:0872,58456,727,48326,856,00002,433,024
6Aug 27, 2023 22:0872,61657,263,81625,873,000995,0002,269,184
7Aug 27, 2023 22:0872,70855,127,78225,906,000996,0002,265,088
8Aug 27, 2023 22:0872,78448,457,80726,930,00002,531,328
9Aug 27, 2023 22:0872,92749,139,72223,985,0002,998,0002,265,088
10Aug 27, 2023 22:0881,67491,113,69630,219,24002,289,664
11Aug 27, 2023 22:0881,86892,004,30930,291,05602,289,664
12Aug 27, 2023 22:0882,26193,390,10930,436,67402,289,664