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 7, 2026 22:58anboto1anboto1Score: 11,367Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 7, 2026 22:5911,289381,839,114360,556,00012,008,0002,117,632
2Jun 7, 2026 22:5911,318383,015,909361,459,00012,057,0002,117,632
3Jun 7, 2026 22:5911,335383,280,219361,428,00012,629,0002,117,632
4Jun 7, 2026 22:5911,364384,475,887362,892,00012,132,0002,117,632
5Jun 7, 2026 22:5911,367384,857,167362,979,00012,157,0002,117,632
6Jun 7, 2026 22:5911,391385,220,615363,904,00012,022,0002,117,632
7Jun 7, 2026 22:5911,426386,378,046364,389,00012,700,0002,117,632
8Jun 7, 2026 22:5911,459387,439,872366,051,00012,114,0002,117,632
9Jun 7, 2026 22:5911,570391,481,879369,524,00012,312,0002,117,632