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 14:39Josu San MartinJosu San MartinScore: 75,676Success
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 14:3975,63851,283,45226,987,000999,0002,363,392
2Jan 12, 2026 14:3975,67653,546,18427,000,0001,000,0002,363,392
3Jan 12, 2026 14:3975,87661,418,57226,069,0002,005,0002,289,664