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 listAug 15, 2026 14:34Tomislav TunkovicTomislav TunkovicScore: 3,702Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 15, 2026 14:353,673129,650,865120,196,0001,013,00024,576
2Aug 15, 2026 14:353,673129,708,541120,107,0001,125,00024,576
3Aug 15, 2026 14:353,685130,112,173120,614,0001,008,00024,576
4Aug 15, 2026 14:353,685130,067,344120,593,0001,017,00024,576
5Aug 15, 2026 14:353,702130,660,053121,156,0001,012,00024,576
6Aug 15, 2026 14:353,705130,955,715121,276,0001,003,00024,576
7Aug 15, 2026 14:353,710130,908,136121,437,0001,007,00024,576
8Aug 15, 2026 14:353,713131,095,245121,544,0001,012,00024,576
9Aug 15, 2026 14:353,720131,217,185121,770,0001,002,00024,576