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 listSep 12, 2026 09:47Haha ExpertHaha ExpertScore: 68,516Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 12, 2026 09:4868,35134,057,03724,262,0001,028,0002,117,632
2Sep 12, 2026 09:4868,38333,946,07224,257,0001,045,0002,117,632
3Sep 12, 2026 09:4868,47233,969,26624,294,0001,041,0002,117,632
4Sep 12, 2026 09:4868,48634,808,34924,317,0001,023,0002,117,632
5Sep 12, 2026 09:4868,51633,871,87324,300,0001,051,0002,117,632
6Sep 12, 2026 09:4868,52734,014,36824,318,0001,037,0002,117,632
7Sep 12, 2026 09:4868,58133,983,18724,343,0001,032,0002,117,632
8Sep 12, 2026 09:4868,59133,995,30824,345,0001,034,0002,117,632
9Sep 12, 2026 09:4869,95635,321,83724,826,0001,058,0002,117,632