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 22, 2025 05:52Ian MckibbenIan MckibbenScore: 19,095Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 22, 2025 05:5219,019649,810,194531,678,00095,941,0002,285,568
2Jun 22, 2025 05:5219,050650,652,261536,697,00091,948,0002,281,472
3Jun 22, 2025 05:5219,069651,663,148539,371,00089,895,0002,428,928
4Jun 22, 2025 05:5219,084653,394,631544,809,00084,970,0002,342,912
5Jun 22, 2025 05:5219,095658,104,259551,243,00078,891,0002,531,328
6Jun 22, 2025 05:5219,115657,089,550538,819,00091,969,0002,486,272
7Jun 22, 2025 05:5219,140661,553,120542,682,00088,947,0002,269,184
8Jun 22, 2025 05:5219,158655,766,282551,309,00080,898,0002,531,328
9Jun 22, 2025 05:5219,314660,859,576544,445,00092,905,0002,502,656