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 listMar 20, 2026 12:44Dominique GarmierDominique GarmierScore: 24,128Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 19, 2026 21:4523,126787,464,973755,177,0007,991,0002,449,408
2Mar 19, 2026 21:4523,190794,512,761757,269,0007,992,0002,445,312
3Mar 19, 2026 21:4523,330796,718,859762,895,0006,999,0002,347,008
4Mar 20, 2026 12:4424,128820,614,488789,246,0006,993,0002,310,144
5Mar 20, 2026 12:4424,197825,158,429790,503,0007,984,0002,330,624
6Mar 20, 2026 12:4424,269826,640,102793,900,0006,990,0002,326,528