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 listOct 12, 2025 03:29Marco BarboneMarco BarboneScore: 46,901Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 12, 2025 03:2946,6101,569,238,3451,523,154,00014,991,0002,334,720
2Oct 12, 2025 03:2946,6891,571,362,2931,523,753,00016,986,0002,326,528
3Oct 12, 2025 03:2946,7421,576,831,9561,527,496,00014,985,0002,412,544
4Oct 12, 2025 03:2946,8131,576,246,2851,530,836,00013,989,0002,322,432
5Oct 12, 2025 03:2946,9011,575,778,7211,530,763,00016,986,0002,322,432
6Oct 12, 2025 03:2947,1421,585,157,5671,540,701,00014,987,0002,502,656
7Oct 12, 2025 03:2947,3521,589,871,1601,544,640,00017,960,0002,322,432
8Oct 12, 2025 03:2947,3901,594,087,4621,550,883,00012,973,0002,383,872
9Oct 12, 2025 03:2947,5991,608,067,1331,556,776,00013,980,0002,326,528