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 12:59anboto1anboto1Score: 8,627Success
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 13:008,599293,047,652270,332,00013,455,0002,117,632
2Jun 8, 2026 13:008,607293,388,016270,629,00013,420,0002,117,632
3Jun 8, 2026 13:008,614293,589,736270,772,00013,497,0002,117,632
4Jun 8, 2026 13:008,617293,695,223270,878,00013,498,0002,117,632
5Jun 8, 2026 13:008,627293,992,939271,240,00013,454,0002,117,632
6Jun 8, 2026 13:008,639294,314,904271,598,00013,499,0002,117,632
7Jun 8, 2026 13:008,674295,485,225272,599,00013,673,0002,117,632
8Jun 8, 2026 13:008,677295,598,641272,741,00013,619,0002,117,632
9Jun 8, 2026 13:008,684295,840,961272,982,00013,610,0002,117,632