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 2, 2022 05:02Robert BurkeRobert BurkeScore: 25,859,130Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 2, 2022 05:0225,779,7579,591,879,7839,538,510,16402,277,376
2Aug 2, 2022 05:0225,859,1309,619,755,1819,567,877,97902,269,184
3Aug 2, 2022 05:0226,215,0369,753,681,8409,699,563,27202,252,800