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 listNov 15, 2025 23:00Aniruddha DebAniruddha DebScore: 15,378Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 15, 2025 23:0015,037451,124,732394,810,00033,983,0002,531,328
2Nov 15, 2025 23:0015,147454,416,631392,163,00035,923,0002,596,864
3Nov 15, 2025 23:0015,273458,200,248399,221,00034,931,0002,650,112
4Nov 15, 2025 23:0015,341460,229,670401,182,00035,926,0002,535,424
5Nov 15, 2025 23:0015,378461,325,604409,726,00027,981,0002,678,784
6Nov 15, 2025 23:0015,383461,488,706402,161,00033,929,0002,764,800
7Nov 15, 2025 23:0015,436463,079,384403,870,00030,913,0002,560,000
8Nov 15, 2025 23:0015,640469,191,358399,630,00038,964,0002,584,576
9Nov 15, 2025 23:0015,672470,148,049410,385,00036,944,0002,539,520