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 12, 2025 23:15Leon ZhaoLeon ZhaoScore: 24,947Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 12, 2025 23:1524,647836,676,463761,396,00051,958,0002,322,432
2Aug 12, 2025 23:1524,947851,656,497762,321,00060,945,0002,473,984
3Aug 12, 2025 23:1525,041852,525,626774,465,00051,897,0002,387,968