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 listApr 19, 2025 01:34etherealetherealScore: 119,841Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 19, 2025 01:34118,92270,927,32441,001,0003,000,0002,527,232
2Apr 19, 2025 01:34119,16875,234,30142,088,0002,004,0002,363,392
3Apr 19, 2025 01:34119,22272,144,98642,107,0002,005,0002,359,296
4Apr 19, 2025 01:34119,46567,994,45143,198,0001,004,0002,400,256
5Apr 19, 2025 01:34119,84172,194,45842,326,0002,015,0002,359,296
6Apr 19, 2025 01:34120,09267,759,99344,434,00002,514,944
7Apr 19, 2025 01:34120,31470,918,96141,481,0003,035,0002,519,040
8Apr 19, 2025 01:34120,31467,846,89242,493,0002,023,0002,506,752
9Apr 19, 2025 01:34120,51970,528,17244,592,00002,519,040