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 11:08anboto1anboto1Score: 5,523Success
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 11:095,461189,541,792171,009,0009,227,0002,117,632
2Jun 8, 2026 11:095,479190,578,402171,592,0009,238,0002,117,632
3Jun 8, 2026 11:095,497190,701,947172,208,0009,215,0002,117,632
4Jun 8, 2026 11:095,509192,208,848172,533,0009,285,0002,117,632
5Jun 8, 2026 11:095,523191,980,290173,068,0009,205,0002,117,632
6Jun 8, 2026 11:095,552192,470,839173,800,0009,445,0002,117,632
7Jun 8, 2026 11:095,555192,940,056174,028,0009,292,0002,117,632
8Jun 8, 2026 11:095,581193,565,491174,983,0009,200,0002,117,632
9Jun 8, 2026 11:095,583193,435,435175,043,0009,198,0002,117,632