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 16, 2026 08:26M-RochatM-RochatScore: 56,536Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 16, 2026 08:2855,9701,856,483,0821,823,146,00023,879,0002,113,536
2May 16, 2026 08:2856,0481,859,419,3191,825,724,00023,876,0002,113,536
3May 16, 2026 08:2856,1951,866,509,0621,827,433,00027,031,0002,113,536
4May 16, 2026 08:2856,2341,866,275,9361,831,152,00024,593,0002,113,536
5May 16, 2026 08:2856,5361,876,557,4231,840,994,00024,721,0002,113,536
6May 16, 2026 08:2856,8831,887,918,0211,852,288,00024,851,0002,113,536
7May 16, 2026 08:2856,9321,888,962,9711,854,437,00024,343,0002,113,536
8May 16, 2026 08:2857,9171,921,663,7291,885,713,00025,555,0002,113,536
9May 16, 2026 08:2858,0441,927,267,7181,891,424,00024,052,0002,113,536