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:40Tomislav TunkovicTomislav TunkovicScore: 3,546Success
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:423,517125,877,920115,084,0001,003,00024,576
2Aug 15, 2026 14:423,519124,573,990115,049,0001,106,00024,576
3Aug 15, 2026 14:423,540125,264,332115,843,0001,002,00024,576
4Aug 15, 2026 14:423,545125,232,648115,989,0001,010,00024,576
5Aug 15, 2026 14:423,546125,869,704115,906,0001,130,00024,576
6Aug 15, 2026 14:423,547125,587,957115,947,0001,126,00024,576
7Aug 15, 2026 14:423,551125,532,491116,086,0001,117,00024,576
8Aug 15, 2026 14:423,552125,528,819116,218,0001,004,00024,576
9Aug 15, 2026 14:423,556125,730,470116,370,0001,004,00024,576