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 listFeb 1, 2025 07:20mebowlermebowlerError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 1, 2025 07:2000000Error: Exit with code 2: panic: mmap: open "/dev/stdin": open /dev/stdin: permission denied goroutine 1 [running]: main.main() /tmp/solution469500311/main.go:58 +0x3f6stderr