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 8, 2026 01:48anboto1anboto1Score: 9,831Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 8, 2026 01:499,640327,729,812305,503,00012,630,0002,117,632
2Jun 8, 2026 01:499,734330,556,145308,400,00012,824,0002,117,632
3Jun 8, 2026 01:499,751331,497,049309,894,00011,903,0002,117,632
4Jun 8, 2026 01:499,815333,604,802311,226,00012,679,0002,117,632
5Jun 8, 2026 01:499,831333,807,414311,632,00012,793,0002,117,632
6Jun 8, 2026 01:499,897335,863,681314,598,00012,003,0002,117,632
7Jun 8, 2026 01:499,920336,693,148314,590,00012,780,0002,117,632
8Jun 8, 2026 01:499,935337,117,655315,242,00012,626,0002,117,632
9Jun 8, 2026 01:4910,070343,562,231320,149,00012,164,0002,117,632