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 listDec 4, 2024 03:57Hayden DonnellyHayden DonnellyScore: 112,173Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 4, 2024 03:57110,37065,416,21939,841,000996,0002,433,024
2Dec 4, 2024 03:57110,42474,847,96138,864,0001,993,0002,269,184
3Dec 4, 2024 03:57111,57365,881,40241,282,00002,531,328
4Dec 4, 2024 03:57111,85164,262,54741,385,00002,531,328
5Dec 4, 2024 03:57112,17364,250,20540,492,0001,012,0002,433,024
6Dec 4, 2024 03:57112,27067,326,16040,527,0001,013,0002,269,184
7Dec 4, 2024 03:57112,33068,173,82341,562,00002,433,024
8Dec 4, 2024 03:57113,06867,885,27140,839,000996,0002,531,328
9Dec 4, 2024 03:57113,75768,380,92241,088,0001,002,0002,510,848