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 16:47anboto1anboto1Score: 5,649Success
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 16:485,594193,911,399175,329,0009,288,0002,117,632
2Jun 8, 2026 16:485,611194,427,267175,912,0009,277,0002,117,632
3Jun 8, 2026 16:485,636195,271,729176,752,0009,268,0002,117,632
4Jun 8, 2026 16:485,646196,082,819177,111,0009,212,0002,117,632
5Jun 8, 2026 16:485,649195,644,967177,082,0009,360,0002,117,632
6Jun 8, 2026 16:485,652195,815,032177,232,0009,312,0002,117,632
7Jun 8, 2026 16:485,659196,013,128177,533,0009,231,0002,117,632
8Jun 8, 2026 16:485,667196,660,943177,692,0009,351,0002,117,632
9Jun 8, 2026 16:485,706197,558,921178,931,0009,388,0002,117,632