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 27, 2026 22:04Victor MerckléVictor MerckléScore: 3,405Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 27, 2026 22:053,389121,112,591110,752,0001,102,0002,113,536
2Jun 27, 2026 22:053,396119,759,956110,964,0001,129,0002,113,536
3Jun 27, 2026 22:053,397119,816,720111,007,0001,113,0002,113,536
4Jun 27, 2026 22:053,400119,978,190111,100,0001,104,0002,113,536
5Jun 27, 2026 22:053,405120,179,970111,281,0001,116,0002,113,536
6Jun 27, 2026 22:053,406120,828,558111,315,0001,088,0002,113,536
7Jun 27, 2026 22:053,408120,602,221111,313,0001,179,0002,113,536
8Jun 27, 2026 22:053,415120,775,249111,581,0001,135,0002,113,536
9Jun 27, 2026 22:053,418121,120,303111,613,0001,186,0002,113,536