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 listMay 5, 2026 17:18olliecrowolliecrowScore: 10,955Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 5, 2026 17:1910,912379,663,267317,494,00042,633,0002,318,336
2May 5, 2026 17:1910,933376,957,411317,205,00043,600,0002,318,336
3May 5, 2026 17:1910,936377,561,950317,930,00042,988,0002,306,048
4May 5, 2026 17:1910,941377,856,583317,392,00043,677,0002,314,240
5May 5, 2026 17:1910,955377,112,571318,827,00042,699,0002,310,144
6May 5, 2026 17:1910,977377,223,804318,438,00043,832,0002,310,144
7May 5, 2026 17:1910,998379,683,316319,431,00043,508,0002,306,048
8May 5, 2026 17:1911,006379,969,592319,706,00043,518,0002,318,336
9May 5, 2026 17:1911,065381,850,754321,478,00043,680,0002,318,336