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 listNov 10, 2025 18:46izotoffizotoffScore: 128,392Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 10, 2025 18:46128,22270,323,79145,380,0002,062,0002,473,984
2Nov 10, 2025 18:46128,39267,513,33646,495,0001,010,0002,301,952
3Nov 10, 2025 18:46129,21976,434,45246,815,000996,0002,392,064