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 listJan 13, 2026 02:02Josu San MartinJosu San MartinScore: 69,397Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 13, 2026 02:0269,38150,044,85224,645,0001,026,0002,359,296
2Jan 13, 2026 02:0269,39753,338,96824,650,0001,027,0002,342,912
3Jan 13, 2026 02:0270,00057,741,27424,864,0001,036,0002,281,472