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 27, 2026 12:54Shikhar SoniShikhar SoniError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Oct 31, 2026 16:32Andrew Epstein48.51CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 31, 2026 16:570285,962,228250,750,00024,332,0002,113,536expected "2904812 ", got "1337007 "
2Oct 31, 2026 16:570284,194,781248,886,00024,545,0002,113,536expected "2902704 ", got "1335664 "
3Oct 31, 2026 16:57035,538,269024,835,0002,113,536expected "152 ", got "141 "
4Jun 27, 2026 12:5420,471684,944,878650,779,00024,780,0002,113,536
5Jun 27, 2026 12:5420,613689,397,628655,314,00024,931,0002,113,536
6Jun 27, 2026 12:5420,749701,651,302660,288,00024,446,0002,113,536