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 1, 2026 06:23olliecrowolliecrowScore: 15,665Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 1, 2026 06:2415,575536,414,663509,003,0005,000,0002,306,048
2May 1, 2026 06:2415,616530,939,855510,356,0005,003,0002,404,352
3May 1, 2026 06:2415,618536,436,118509,429,0005,993,0002,330,624
4May 1, 2026 06:2415,652536,015,388510,536,0005,994,0002,342,912
5May 1, 2026 06:2415,665534,641,668511,963,0004,999,0002,301,952
6May 1, 2026 06:2415,675536,528,568512,283,0005,002,0002,306,048
7May 1, 2026 06:2415,676538,136,377512,336,0005,003,0002,342,912
8May 1, 2026 06:2415,688533,841,976511,738,0005,996,0002,314,240
9May 1, 2026 06:2415,783540,446,293515,845,0004,998,0002,314,240