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 listSep 4, 2024 14:42Yuriy LyfenkoYuriy LyfenkoError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Oct 31, 2026 16:14Andrew Epstein10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 31, 2026 16:260108,669,07691,871,0006,115,00016,384No answer to stdout. Died or killed?
2Sep 4, 2024 14:429,095324,816,258296,141,0004,001,0002,355,200
3Sep 4, 2024 14:429,124331,398,436291,094,00010,003,0002,428,928
4Sep 4, 2024 14:429,303335,653,862301,996,0004,999,0002,523,136