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 00:01Josu San MartinJosu San MartinScore: 71,373Success
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 00:0171,22752,025,04725,341,0001,013,0002,473,984
2Jan 13, 2026 00:0171,37353,051,27025,393,0001,015,0002,289,664
3Jan 13, 2026 00:0171,80553,277,02525,584,000984,0002,461,696