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 listAug 17, 2026 04:26marko1597marko1597Score: 8,794Success
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Sep 4, 2026 11:04Tomislav Tunkovic10.00CustomSolution Held
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 17, 2026 04:538,759297,410,328277,440,00011,610,0002,121,728stderr
2Aug 17, 2026 04:538,762297,518,883277,472,00011,681,0002,121,728stderr
3Aug 17, 2026 04:538,792298,418,177278,164,00011,988,0002,121,728stderr
4Aug 17, 2026 04:538,793298,445,639278,228,00011,944,0002,121,728stderr
5Aug 17, 2026 04:538,794298,483,505278,501,00011,719,0002,121,728stderr
6Aug 17, 2026 04:538,831299,819,273279,396,00012,047,0002,121,728stderr
7Aug 17, 2026 04:538,835299,868,602279,693,00011,885,0002,121,728stderr
8Aug 17, 2026 04:539,283314,592,900294,076,00012,269,0002,121,728stderr
9Aug 17, 2026 04:539,326316,053,324296,193,00011,588,0002,121,728stderr