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:37anboto1anboto1Score: 13,053Success
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:3812,877434,324,117412,389,00012,575,0002,117,632
2Jun 7, 2026 20:3812,887434,778,467412,593,00012,700,0002,117,632
3Jun 7, 2026 20:3812,919436,141,731413,585,00012,753,0002,117,632
4Jun 7, 2026 20:3812,928435,923,167414,208,00012,433,0002,117,632
5Jun 7, 2026 20:3813,053440,084,222418,299,00012,460,0002,117,632
6Jun 7, 2026 20:3813,101442,106,528419,131,00013,234,0002,117,632
7Jun 7, 2026 20:3813,169443,920,290421,165,00013,421,0002,117,632
8Jun 7, 2026 20:3813,223445,651,078423,024,00013,352,0002,117,632
9Jun 7, 2026 20:3813,228445,725,898423,197,00013,337,0002,117,632