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 6, 2026 22:25Pavel SamyginPavel SamyginScore: 17,552Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 6, 2026 22:2517,167594,861,732547,524,00018,983,0002,437,120
2Mar 6, 2026 22:2517,440604,293,130554,544,00020,982,0002,375,680
3Mar 6, 2026 22:2517,480607,066,251555,856,00020,994,0002,453,504
4Mar 6, 2026 22:2517,534608,394,161553,653,00024,984,0002,490,368
5Mar 6, 2026 22:2517,552605,685,191557,248,00021,970,0002,293,760
6Mar 6, 2026 22:2517,567611,315,044558,713,00020,989,0002,387,968
7Mar 6, 2026 22:2517,983614,396,172568,472,00024,976,0002,297,856
8Mar 6, 2026 22:2518,202622,048,098576,694,00023,987,0002,355,200
9Mar 6, 2026 22:2518,297625,509,004581,810,00021,992,0002,441,216