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 12, 2026 21:59Josu San MartinJosu San MartinScore: 71,570Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 12, 2026 21:5971,27047,548,04125,356,0001,014,0002,342,912
2Jan 12, 2026 21:5971,57046,167,73325,463,0001,018,0002,371,584
3Jan 12, 2026 21:5971,66249,640,08725,496,0001,019,0002,363,392