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 listJan 8, 2026 03:48Josu San MartinJosu San MartinScore: 94,602Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 8, 2026 03:4894,31613,053,017,7361,457,984,0001,654,451,0002,445,312
2Jan 8, 2026 03:4894,60213,020,797,6951,443,095,0001,678,766,0002,494,464
3Jan 8, 2026 03:4897,38313,823,543,8221,406,809,0001,806,815,0002,469,888