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 09:28anboto1anboto1Score: 5,529Success
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 09:295,477190,150,606171,579,0009,176,0002,117,632
2Jun 8, 2026 09:295,498190,861,082172,207,0009,258,0002,117,632
3Jun 8, 2026 09:295,516191,253,376173,768,0008,273,0002,117,632
4Jun 8, 2026 09:295,518191,490,182172,822,0009,276,0002,117,632
5Jun 8, 2026 09:295,529191,786,654173,203,0009,285,0002,117,632
6Jun 8, 2026 09:295,537192,023,682173,482,0009,241,0002,117,632
7Jun 8, 2026 09:295,548192,265,573173,754,0009,330,0002,117,632
8Jun 8, 2026 09:295,573193,236,959174,508,0009,419,0002,117,632
9Jun 8, 2026 09:295,586193,599,721174,979,0009,374,0002,117,632