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 listApr 24, 2026 09:37Charles CabergsCharles CabergsScore: 37,435Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 24, 2026 09:3837,1571,248,033,3621,217,191,0008,994,0002,478,080
2Apr 24, 2026 09:3837,3011,255,211,9281,224,934,0005,999,0002,347,008
3Apr 24, 2026 09:3837,3051,251,820,8731,222,094,0008,993,0002,322,432
4Apr 24, 2026 09:3837,4331,254,658,9831,225,303,0009,994,0002,486,272
5Apr 24, 2026 09:3837,4351,254,931,2191,226,362,0008,995,0002,318,336
6Apr 24, 2026 09:3837,5331,255,681,9181,226,596,00011,996,0002,486,272
7Apr 24, 2026 09:3837,5711,255,702,8681,232,858,0006,999,0002,478,080
8Apr 24, 2026 09:3837,7491,262,991,2421,236,732,0008,998,0002,318,336
9Apr 24, 2026 09:3838,3641,282,946,0281,255,026,00010,991,0002,478,080