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 19:13Yuriy LyfenkoYuriy LyfenkoError
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 19:1300000Error: exit with code 2: unexpected fault address 0x7f7085000000 fatal error: fault [signal SIGSEGV: segmentation violation code=0x1 addr=0x7f7085000000 pc=0x5652a463acdd] goroutine 1 [running]: runtime.throw(0x5652a463c35f, 0x5) /usr/lib/go-1.13/src...stderr