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 listMar 17, 2026 00:50Dominique GarmierDominique GarmierError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Oct 31, 2026 17:37Andrew Epstein10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 31, 2026 17:440216,617,890199,006,0006,774,0002,113,536expected "2904064 ", got "1817140 "
2Oct 31, 2026 17:443911,767,65701,295,0002,117,632
3Oct 31, 2026 17:444311,964,84501,447,0002,117,632
4Mar 17, 2026 00:5019,313663,566,338625,333,00011,987,0002,363,392
5Mar 17, 2026 00:5019,675675,377,814637,284,00011,986,0002,461,696
6Mar 17, 2026 00:5020,279695,807,945658,209,00010,986,0002,273,280