Unique strings Sergey Svistunov

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 22, 2025 06:14Ian MckibbenIan MckibbenScore: 16,746Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 22, 2025 06:1416,676574,838,610459,434,00090,888,0002,539,520
2Jun 22, 2025 06:1416,707582,909,676471,434,00079,904,0002,379,776
3Jun 22, 2025 06:1416,726578,452,753490,969,00060,996,0002,519,040
4Jun 22, 2025 06:1416,738578,223,652484,437,00067,921,0002,375,680
5Jun 22, 2025 06:1416,746574,624,971472,666,00079,943,0002,314,240
6Jun 22, 2025 06:1416,802579,590,952470,561,00083,921,0002,281,472
7Jun 22, 2025 06:1416,820584,208,951466,051,00089,009,0002,531,328
8Jun 22, 2025 06:1417,037585,831,444479,349,00082,887,0002,375,680
9Jun 22, 2025 06:1417,063588,917,574476,216,00086,857,0002,322,432