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 05:00Josu San MartinJosu San MartinScore: 70,743Success
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 05:0070,69552,154,42225,151,0001,006,0002,363,392
2Jan 12, 2026 05:0070,74350,975,80725,169,0001,006,0002,289,664
3Jan 12, 2026 05:0071,05152,871,56225,278,0001,011,0002,473,984