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 28, 2026 00:53Victor MerckléVictor MerckléScore: 3,487Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 28, 2026 00:543,479122,792,966113,738,0001,099,0002,113,536
2Jun 28, 2026 00:543,484122,768,024113,823,0001,171,0002,113,536
3Jun 28, 2026 00:543,484123,052,536113,871,0001,133,0002,113,536
4Jun 28, 2026 00:543,485122,773,940113,902,0001,105,0002,113,536
5Jun 28, 2026 00:543,487122,859,036113,975,0001,116,0002,113,536
6Jun 28, 2026 00:543,488123,132,899113,965,0001,163,0002,113,536
7Jun 28, 2026 00:543,498123,704,846114,285,0001,163,0002,113,536
8Jun 28, 2026 00:543,508123,602,026114,669,0001,114,0002,113,536
9Jun 28, 2026 00:543,514123,941,151114,789,0001,174,0002,113,536