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 listJan 9, 2026 19:09AVGAVGScore: 24,901Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 9, 2026 19:0924,765846,789,511784,224,00033,009,0002,277,376
2Jan 9, 2026 19:0924,815842,065,649788,899,00029,996,0002,260,992
3Jan 9, 2026 19:0924,834849,774,301790,529,00028,982,0002,269,184
4Jan 9, 2026 19:0924,857848,155,068782,314,00037,966,0002,265,088
5Jan 9, 2026 19:0924,901844,458,227790,736,00030,989,0002,392,064
6Jan 9, 2026 19:0924,941847,980,544788,046,00035,002,0002,392,064
7Jan 9, 2026 19:0925,008853,045,382794,292,00030,972,0002,265,088
8Jan 9, 2026 19:0925,047856,451,930795,554,00030,982,0002,392,064
9Jan 9, 2026 19:0925,398862,320,351803,170,00034,963,0002,297,856