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 25, 2026 09:24Charles CabergsCharles CabergsScore: 34,921Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 25, 2026 09:2534,3811,148,728,9251,129,606,0004,998,0002,334,720
2Apr 25, 2026 09:2534,4561,161,197,4351,129,071,0007,993,0002,334,720
3Apr 25, 2026 09:2534,5451,156,810,4151,133,013,0007,000,0002,334,720
4Apr 25, 2026 09:2534,8031,166,839,8571,143,516,0004,997,0002,322,432
5Apr 25, 2026 09:2534,9211,171,034,5691,145,416,0006,996,0002,338,816
6Apr 25, 2026 09:2537,0661,240,041,9851,214,192,0008,994,0002,334,720
7Apr 25, 2026 09:2537,3781,257,368,5561,228,489,0004,997,0002,338,816
8Apr 25, 2026 09:2537,4911,257,242,3481,229,226,0007,994,0002,334,720
9Apr 25, 2026 09:2537,7061,264,913,0891,234,309,0009,994,0002,318,336