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 15:24izotoffizotoffScore: 120,557Success
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 14:47119,58172,208,02442,234,0002,011,0002,322,432
2Nov 10, 2025 15:24120,01964,270,31041,380,0003,027,0002,297,856
3Nov 10, 2025 14:47120,45169,223,01643,555,0001,012,0002,433,024
4Nov 10, 2025 15:24120,55773,663,69542,579,0002,027,0002,424,832
5Nov 10, 2025 15:24121,22275,912,16544,852,00002,437,120
6Nov 10, 2025 14:47121,22469,458,55343,857,000996,0002,322,432