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 listDec 20, 2025 07:07Rajarshi BasuRajarshi BasuError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Oct 31, 2026 16:24Andrew Epstein10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 31, 2026 16:54018,006,4935,053,0002,197,0002,125,824expected "1690 ", got "1330 "stderr
2Oct 31, 2026 16:540125,765,340110,569,0004,198,0002,117,632expected "2106315 ", got "1188186 "stderr
3Oct 31, 2026 16:54013,862,9131,635,0001,635,0002,125,824expected "895 ", got "763 "stderr
4Dec 20, 2025 07:075,296198,366,469171,779,0002,996,0002,445,312
5Dec 20, 2025 07:075,306203,418,850170,109,0005,003,0002,293,760
6Dec 20, 2025 07:075,347201,977,710170,440,0006,015,0002,523,136