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 23, 2025 10:27zielajzielajError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 5, 2026 14:25Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 5, 2026 14:26011,101,4001,601,0001,601,0002,121,728expected "16384 ", got "32 "stderr
2Jul 5, 2026 14:26011,045,3671,667,0001,666,0002,121,728expected "16384 ", got "32 "stderr
3Jul 5, 2026 14:26010,888,3091,577,0001,577,0002,121,728expected "16384 ", got "32 "stderr
4Dec 23, 2025 10:284,219158,899,878128,210,00011,018,0002,510,848
5Dec 23, 2025 10:274,239164,221,744129,892,0009,991,0002,379,776
6Dec 23, 2025 10:284,262172,652,755133,675,0006,983,0002,379,776
7Dec 23, 2025 10:274,265165,765,859129,770,00010,980,0002,375,680
8Dec 23, 2025 10:284,287171,359,398131,448,00010,034,0002,392,064
9Dec 23, 2025 10:274,301165,630,201129,947,00011,995,0002,342,912