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:53izotoffizotoffScore: 125,411Success
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:53125,14671,159,61945,298,0001,006,0002,363,392
2Nov 10, 2025 18:53125,41168,349,95945,394,0001,008,0002,297,856
3Nov 10, 2025 18:53125,51175,125,73845,430,0001,009,0002,367,488