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 3, 2023 21:56Franek KortaFranek KortaScore: 72,541Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 3, 2023 21:5671,87648,262,39825,572,0001,022,0002,445,312
2Apr 3, 2023 21:5672,03255,527,34026,652,00002,269,184
3Apr 3, 2023 21:5672,04352,439,71126,656,00002,531,328
4Apr 3, 2023 21:5672,10352,726,27525,652,0001,026,0002,531,328
5Apr 3, 2023 21:5672,17851,112,10826,706,00002,441,216
6Apr 3, 2023 21:5672,25448,744,04525,744,000990,0002,445,312
7Apr 3, 2023 21:5672,54152,767,13326,840,00002,531,328
8Apr 3, 2023 21:5672,54948,864,45225,849,000994,0002,527,232
9Apr 3, 2023 21:5672,66250,147,80325,890,000995,0002,441,216
10Apr 3, 2023 21:5675,783104,463,74028,039,73002,297,856
11Apr 3, 2023 21:5676,42490,138,26728,276,82502,174,976
12Apr 3, 2023 21:5676,80092,111,81228,416,06602,170,880