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 3, 2026 20:42TudyMTudyMScore: 29,121Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 3, 2026 20:4628,622959,624,305929,063,00015,482,0002,543,616
2May 3, 2026 20:4628,834966,348,876935,920,00015,607,0002,539,520
3May 3, 2026 20:4628,865969,111,674937,079,00015,493,0002,535,424
4May 3, 2026 20:4629,104977,897,553944,868,00015,576,0002,310,144
5May 3, 2026 20:4629,121975,796,706945,395,00015,630,0002,539,520
6May 3, 2026 20:4629,286983,910,095950,723,00015,730,0002,543,616
7May 3, 2026 20:4629,9631,006,181,800973,101,00015,685,0002,539,520
8May 3, 2026 20:4631,1401,045,777,3341,012,086,00015,557,0002,535,424
9May 3, 2026 20:4631,3201,052,559,5461,017,947,00015,629,0002,531,328