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 13, 2021 11:03Andrey TsvetkovAndrey TsvetkovError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 13, 2021 11:0300000Error: exit with code 2: unexpected fault address 0x7fa8575bb2fe fatal error: fault [signal SIGSEGV: segmentation violation code=0x1 addr=0x7fa8575bb2fe pc=0x55ee02108bf8] goroutine 1 [running]: runtime.throw(0x55ee0210a35f, 0x5) /usr/lib/go-1.13/src...stderr