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 8, 2025 21:06Aleksei ShahoikaAleksei ShahoikaScore: 6,092,219Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 8, 2025 21:064,662,8351,752,735,6671,723,250,0001,999,0002,277,376
2Sep 8, 2025 21:066,092,2192,281,326,4752,252,122,0001,999,0002,277,376
3Sep 8, 2025 21:066,247,3352,338,581,8802,309,516,0001,998,0002,514,944