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 17, 2026 01:20M-RochatM-RochatScore: 22,203Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 17, 2026 01:2321,367715,793,242699,898,0005,215,0002,113,536
2May 17, 2026 01:2321,388714,646,014700,771,0005,041,0002,113,536
3May 17, 2026 01:2321,461719,569,787703,172,0005,055,0002,113,536
4May 17, 2026 01:2321,463719,475,758703,216,0005,080,0002,113,536
5May 17, 2026 01:2322,203744,324,218727,688,0005,021,0002,113,536
6May 17, 2026 01:2322,420749,285,254734,647,0005,242,0002,113,536
7May 17, 2026 01:2323,685790,472,975776,549,0005,080,0002,113,536
8May 17, 2026 01:2323,689790,759,020776,695,0005,070,0002,113,536
9May 17, 2026 01:2323,767794,076,328779,185,0005,153,0002,113,536