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 8, 2021 15:05Sergey StreminSergey StreminScore: 168,142Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 8, 2021 15:05167,782115,873,00562,079,20702,199,552
2Jul 8, 2021 15:05168,142128,830,82762,212,50202,203,648
3Jul 8, 2021 15:05168,573116,693,08462,371,88302,207,744