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 22, 2026 19:44Victor MerckléVictor MerckléScore: 4,973Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 22, 2026 19:454,964171,638,078127,024,00036,820,0002,113,536
2Jun 22, 2026 19:454,968171,567,353127,113,00036,846,0002,113,536
3Jun 22, 2026 19:454,970172,064,379127,359,00036,652,0002,113,536
4Jun 22, 2026 19:454,971172,098,549127,176,00036,888,0002,113,536
5Jun 22, 2026 19:454,973172,116,928127,520,00036,612,0002,113,536
6Jun 22, 2026 19:454,980172,542,796127,599,00036,760,0002,113,536
7Jun 22, 2026 19:454,989172,183,515127,749,00036,890,0002,113,536
8Jun 22, 2026 19:454,999173,043,272128,135,00036,864,0002,113,536
9Jun 22, 2026 19:455,004172,689,627127,679,00037,485,0002,113,536