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 17:07Tomislav TunkovicTomislav TunkovicScore: 3,299Success
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 17:083,267116,053,077106,818,0001,003,00024,576
2Aug 15, 2026 17:083,291116,852,335107,589,0001,016,00024,576
3Aug 15, 2026 17:083,293117,035,787107,539,0001,138,00024,576
4Aug 15, 2026 17:083,293116,933,711107,664,0001,005,00024,576
5Aug 15, 2026 17:083,299117,283,629107,863,0001,006,00024,576
6Aug 15, 2026 17:083,304117,566,971108,036,0001,002,00024,576
7Aug 15, 2026 17:083,306117,607,773108,106,0001,002,00024,576
8Aug 15, 2026 17:083,307118,321,518108,009,0001,130,00024,576
9Aug 15, 2026 17:083,312117,872,924108,312,0001,005,00024,576