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 listSep 6, 2022 15:20Eugene ZhydzetskiEugene ZhydzetskiError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 6, 2022 15:2000000Error: Exit with code 2: 2022/09/06 15:20:53 Batch: 44 panic: to small batch goroutine 1 [running]: main.solve() /tmp/solution274053184/task11.go:39 +0x272 main.main() /tmp/solution274053184/main.go:4 +0x17stderr