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 20:52anboto1anboto1Score: 12,763Success
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 20:5412,572424,683,192402,030,00012,875,0002,117,632
2Jun 7, 2026 20:5412,612425,968,514403,370,00012,846,0002,117,632
3Jun 7, 2026 20:5412,619426,243,154403,601,00012,832,0002,117,632
4Jun 7, 2026 20:5412,762430,440,795407,895,00013,270,0002,117,632
5Jun 7, 2026 20:5412,763430,525,553407,847,00013,352,0002,117,632
6Jun 7, 2026 20:5412,768430,669,182408,030,00013,331,0002,117,632
7Jun 7, 2026 20:5412,786431,721,002409,545,00012,410,0002,117,632
8Jun 7, 2026 20:5412,860433,690,397411,064,00013,317,0002,117,632
9Jun 7, 2026 20:5412,935436,138,296413,418,00013,462,0002,117,632