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 02:01Yuriy LyfenkoYuriy LyfenkoScore: 151,204Success
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 02:01143,9931,055,284,97653,277,456062,017,536
2Jul 8, 2021 02:03144,8191,016,944,41953,583,147061,403,136
3Jul 8, 2021 02:03149,0211,008,239,84055,137,657059,928,576
4Jul 8, 2021 02:01151,2041,031,665,49455,945,626061,227,008
5Jul 8, 2021 02:01151,7681,076,332,94856,154,342062,685,184
6Jul 8, 2021 02:03152,1701,037,604,06556,302,800065,564,672