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 listApr 19, 2026 03:55Charles CabergsCharles CabergsScore: 62,074Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 19, 2026 03:5559,4191,981,820,9391,947,849,00012,992,0002,277,376
2Apr 19, 2026 03:5562,0742,078,007,2112,039,448,0008,993,0002,469,888
3Apr 19, 2026 03:5562,9822,107,854,2192,065,427,00012,990,0002,342,912