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 7, 2026 17:06anboto1anboto1Score: 24,941Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 7, 2026 17:0724,823828,654,101812,439,0006,735,0002,113,536
2Jun 7, 2026 17:0724,869830,081,896813,873,0006,811,0002,113,536
3Jun 7, 2026 17:0724,877830,800,134814,164,0006,803,0002,113,536
4Jun 7, 2026 17:0724,936832,644,565815,904,0006,984,0002,113,536
5Jun 7, 2026 17:0724,941832,433,161816,496,0006,574,0002,113,536
6Jun 7, 2026 17:0725,182840,331,355824,265,0006,770,0002,113,536
7Jun 7, 2026 17:0725,340845,777,795829,427,0006,811,0002,113,536
8Jun 7, 2026 17:0726,295877,014,278860,988,0006,764,0002,113,536
9Jun 7, 2026 17:0726,449882,173,826866,818,0006,015,0002,113,536