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 31, 2026 06:14TonyTonyScore: 22,404,764Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 31, 2026 06:2522,291,6978,259,104,6188,101,967,000145,961,0002,113,536
2Jul 31, 2026 06:2522,404,7648,300,785,9658,138,521,000151,242,0002,113,536
3Jul 31, 2026 06:2522,446,6788,316,351,2388,159,100,000146,171,0002,113,536