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 31, 2026 02:17Tomislav TunkovicTomislav TunkovicScore: 3,037Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 31, 2026 02:233,005107,722,76198,058,0001,120,00024,576
2Aug 31, 2026 02:233,005107,602,28898,064,0001,113,00024,576
3Aug 31, 2026 02:233,031108,494,00799,047,0001,003,00024,576
4Aug 31, 2026 02:233,035108,616,23399,168,0001,004,00024,576
5Aug 31, 2026 02:233,037108,745,04699,242,0001,004,00024,576
6Aug 31, 2026 02:233,045109,064,12599,363,0001,134,00024,576
7Aug 31, 2026 02:233,046108,993,02599,521,0001,009,00024,576
8Aug 31, 2026 02:233,054109,230,82399,787,0001,006,00024,576
9Aug 31, 2026 02:233,056110,051,11299,744,0001,131,00024,576