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 8, 2026 01:44anboto1anboto1Score: 9,898Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 8, 2026 01:459,766331,551,523309,685,00012,611,0002,117,632
2Jun 8, 2026 01:459,787332,755,598310,838,00012,134,0002,117,632
3Jun 8, 2026 01:459,872335,548,547313,622,00012,170,0002,117,632
4Jun 8, 2026 01:459,896336,344,607314,334,00012,246,0002,117,632
5Jun 8, 2026 01:459,898335,976,255313,875,00012,770,0002,117,632
6Jun 8, 2026 01:4510,042340,677,983318,563,00012,824,0002,117,632
7Jun 8, 2026 01:4510,069341,547,236319,384,00012,899,0002,117,632
8Jun 8, 2026 01:4510,127343,964,075321,967,00012,250,0002,117,632
9Jun 8, 2026 01:4510,135343,753,435321,765,00012,716,0002,117,632