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 listMar 15, 2026 20:50Elijah KinElijah KinScore: 161,689Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 15, 2026 20:50159,58187,144,90015,011,00044,034,0002,318,336
2Mar 15, 2026 20:50160,38181,389,65816,092,00043,249,0002,322,432
3Mar 15, 2026 20:50161,08986,323,56010,102,00049,501,0002,318,336
4Mar 15, 2026 20:50161,11486,090,47616,166,00043,446,0002,322,432
5Mar 15, 2026 20:50161,68985,791,75516,950,00042,875,0002,437,120
6Mar 15, 2026 20:50161,82483,768,29724,948,00034,927,0002,273,280
7Mar 15, 2026 20:50162,52482,536,73415,033,00045,101,0002,310,144
8Mar 15, 2026 20:50162,87385,827,93918,079,00042,184,0002,273,280
9Mar 15, 2026 20:50163,31186,333,36714,099,00046,326,0002,314,240