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 19:44anboto1anboto1Score: 14,044Success
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 19:4513,908468,273,115445,866,00013,108,0002,117,632
2Jun 7, 2026 19:4514,003471,457,398448,644,00013,476,0002,117,632
3Jun 7, 2026 19:4514,006471,601,623449,285,00012,939,0002,117,632
4Jun 7, 2026 19:4514,038472,650,431450,495,00012,785,0002,117,632
5Jun 7, 2026 19:4514,044472,857,922450,358,00013,119,0002,117,632
6Jun 7, 2026 19:4514,086474,155,027452,273,00012,587,0002,117,632
7Jun 7, 2026 19:4514,087474,180,660451,553,00013,336,0002,117,632
8Jun 7, 2026 19:4514,108474,937,745453,115,00012,454,0002,117,632
9Jun 7, 2026 19:4514,124475,444,400452,804,00013,316,0002,117,632