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 listMay 13, 2026 16:11Josu San MartinJosu San MartinScore: 3,468Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 13, 2026 16:123,456125,018,904113,011,0001,037,0002,113,536
2May 13, 2026 16:123,465123,136,336113,310,0001,051,0002,113,536
3May 13, 2026 16:123,466125,368,801113,335,0001,045,0002,113,536
4May 13, 2026 16:123,468125,296,037113,393,0001,052,0002,113,536
5May 13, 2026 16:123,468126,036,491113,407,0001,055,0002,113,536
6May 13, 2026 16:123,468123,236,920113,421,0001,048,0002,113,536
7May 13, 2026 16:123,469125,294,441113,438,0001,060,0002,113,536
8May 13, 2026 16:123,469124,511,734113,438,0001,042,0002,113,536
9May 13, 2026 16:123,471123,294,254113,494,0001,060,0002,113,536