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 7, 2021 22:22Yuriy LyfenkoYuriy LyfenkoScore: 8,558,792Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 7, 2021 22:22208,798549,243,21677,255,224056,795,136
2Jul 7, 2021 22:22217,205529,045,68280,365,789059,404,288
3Jul 7, 2021 22:22225,434625,863,73983,410,422063,447,040
4Jul 7, 2021 22:228,558,7923,231,024,6763,166,753,03202,224,128
5Jul 7, 2021 22:229,441,7383,550,523,3193,493,443,21802,269,184
6Jul 7, 2021 22:2218,228,5506,835,668,7046,744,563,52302,236,416