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 19, 2025 08:49Rajarshi BasuRajarshi BasuError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Oct 31, 2026 16:23Andrew Epstein10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 31, 2026 16:390100,101,53882,560,0006,582,0002,117,632expected "2102819 ", got "1186376 "stderr
2Oct 31, 2026 16:39015,027,4031,395,0002,914,0002,125,824expected "1809 ", got "1467 "stderr
3Oct 31, 2026 16:3924919,132,4254,859,0003,388,0002,125,824stderr
4Dec 19, 2025 08:497,663275,880,970247,876,0004,997,0002,347,008
5Dec 19, 2025 08:497,784283,925,833248,888,0007,996,0002,502,656
6Dec 19, 2025 08:498,328304,249,342267,820,0006,995,0002,510,848