Unique strings v2 Sergey Svistunov

Same problem as Unique strings, but with 3 CPUs available and scoring based on wall time instead of CPU time.

Count the exact number of unique tokens as fast as possible.

Input

One token per line on STDIN:

JWXcKKaWzvFL5
Rof
3ztCpA
5wHcGN
*UiEMthaTS*g

Output

Print the exact count of unique tokens to STDOUT.

Constraints

  • Character set: 0123456789abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ@#%*
  • Maximum token length: 16
  • Approximately 1,000,000 unique tokens
Back to listJun 9, 2026 23:21Victor MerckléVictor MerckléScore: 3,193Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 9, 2026 23:223,16895,068,847247,907,0002,012,0002,138,112
2Jun 9, 2026 23:223,17795,322,833248,300,0002,009,0002,146,304
3Jun 9, 2026 23:223,18195,458,388248,896,0002,285,0002,142,208
4Jun 9, 2026 23:223,18395,509,786251,980,0001,140,0002,142,208
5Jun 9, 2026 23:223,19395,816,386250,785,0002,015,0002,142,208
6Jun 9, 2026 23:223,21696,486,580252,520,0002,262,0002,134,016
7Jun 9, 2026 23:223,22096,614,965250,863,0002,297,0002,142,208
8Jun 9, 2026 23:223,22796,828,499250,564,0002,288,0002,138,112
9Jun 9, 2026 23:223,23296,973,542253,323,0002,269,0002,138,112