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 listJun 8, 2026 11:00anboto1anboto1Score: 5,504Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 8, 2026 11:015,463189,607,039171,033,0009,250,0002,117,632
2Jun 8, 2026 11:015,479193,061,982171,588,0009,226,0002,117,632
3Jun 8, 2026 11:015,500193,162,367172,249,0009,252,0002,117,632
4Jun 8, 2026 11:015,502190,859,720172,341,0009,233,0002,117,632
5Jun 8, 2026 11:015,504190,958,681172,516,0009,127,0002,117,632
6Jun 8, 2026 11:015,510191,151,649172,589,0009,263,0002,117,632
7Jun 8, 2026 11:015,548192,863,087173,757,0009,330,0002,117,632
8Jun 8, 2026 11:015,556192,623,387174,128,0009,222,0002,117,632
9Jun 8, 2026 11:015,563192,845,142174,385,0009,205,0002,117,632