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 9, 2021 00:20Yuriy LyfenkoYuriy LyfenkoError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Sep 5, 2026 06:18Tomislav Tunkovic27.62CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 5, 2026 06:360625,297,324602,659,00012,608,0002,113,536expected "2919929 ", got "2913241 "
2Sep 5, 2026 06:360637,371,903615,231,00012,196,0002,113,536expected "2919945 ", got "2913261 "
3Sep 5, 2026 06:360630,158,880607,664,00012,512,0002,113,536expected "2919926 ", got "2913237 "
4Jun 9, 2021 00:2011,516447,263,494380,028,79202,244,608
5Jun 9, 2021 00:2011,595451,418,654382,634,48802,248,704
6Jun 9, 2021 00:2011,821456,534,980390,077,60402,252,800