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:28Tomislav TunkovicTomislav TunkovicScore: 3,614Success
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:313,578126,643,190117,092,0001,013,00024,576
2Aug 15, 2026 14:313,592126,980,859117,420,0001,129,00024,576
3Aug 15, 2026 14:313,605127,435,015117,966,0001,006,00024,576
4Aug 15, 2026 14:313,608127,620,923118,081,0001,002,00024,576
5Aug 15, 2026 14:313,614127,785,344118,260,0001,006,00024,576
6Aug 15, 2026 14:313,620127,969,220118,458,0001,007,00024,576
7Aug 15, 2026 14:313,620127,957,464118,487,0001,003,00024,576
8Aug 15, 2026 14:313,621127,991,843118,380,0001,135,00024,576
9Aug 15, 2026 14:313,627128,196,105118,695,0001,014,00024,576