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 listJul 13, 2021 10:43Andrey TsvetkovAndrey TsvetkovScore: 136,263Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 13, 2021 10:44136,095104,895,50550,354,98302,195,456
2Jul 13, 2021 10:43136,121101,605,19950,364,85402,203,648
3Jul 13, 2021 10:44136,148118,313,44750,374,81602,203,648
4Jul 13, 2021 10:43136,263113,650,99250,417,14702,207,744
5Jul 13, 2021 10:43136,263107,663,47250,417,46302,199,552
6Jul 13, 2021 10:44136,274116,333,41250,421,50802,211,840