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:42Tomislav TunkovicTomislav TunkovicScore: 3,549Success
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:433,525124,549,232115,321,0001,008,00024,576
2Aug 15, 2026 14:433,530125,022,591115,511,0001,010,00024,576
3Aug 15, 2026 14:433,531124,956,282115,424,0001,120,00024,576
4Aug 15, 2026 14:433,536125,078,663115,596,0001,108,00024,576
5Aug 15, 2026 14:433,549125,404,796116,138,0001,010,00024,576
6Aug 15, 2026 14:433,554125,526,690116,279,0001,012,00024,576
7Aug 15, 2026 14:433,554125,484,712116,282,0001,004,00024,576
8Aug 15, 2026 14:433,559125,801,437116,454,0001,005,00024,576
9Aug 15, 2026 14:433,564125,951,851116,621,0001,005,00024,576