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 03:31anboto1anboto1Score: 6,051Success
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 03:326,021207,887,092186,804,00011,895,0002,117,632
2Jun 8, 2026 03:326,029208,676,357187,133,00011,846,0002,117,632
3Jun 8, 2026 03:326,030208,193,572187,075,00011,932,0002,117,632
4Jun 8, 2026 03:326,047208,754,975187,561,00012,010,0002,117,632
5Jun 8, 2026 03:326,051208,960,827187,780,00011,915,0002,117,632
6Jun 8, 2026 03:326,056209,069,895187,842,00012,010,0002,117,632
7Jun 8, 2026 03:326,078209,794,307188,577,00012,025,0002,117,632
8Jun 8, 2026 03:326,092210,282,496188,945,00012,123,0002,117,632
9Jun 8, 2026 03:326,151223,633,326191,321,00011,686,0002,117,632