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:24Yuriy LyfenkoYuriy LyfenkoScore: 10,971,153Success
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:24339,5371,142,741,960125,628,718065,437,696
2Jul 8, 2021 02:24341,2811,131,635,839126,273,986061,370,368
3Jul 8, 2021 02:24341,8641,078,370,077126,489,574061,280,256
4Jul 8, 2021 02:2410,971,1534,630,201,1184,059,326,79302,281,472
5Jul 8, 2021 02:2415,906,1386,509,980,8195,885,271,02702,310,144
6Jul 8, 2021 02:2419,875,2497,976,168,5877,353,842,22302,269,184