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 listMar 16, 2026 23:26Dominique GarmierDominique GarmierScore: 21,694Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 16, 2026 23:2621,566738,833,026700,696,00010,995,0002,334,720
2Mar 16, 2026 23:2621,600737,923,624702,805,0009,997,0002,359,296
3Mar 16, 2026 23:2621,652739,422,814701,535,00012,991,0002,363,392
4Mar 16, 2026 23:2621,675745,528,119706,290,0008,990,0002,322,432
5Mar 16, 2026 23:2621,694745,202,630702,902,00012,998,0002,359,296
6Mar 16, 2026 23:2621,711744,045,546705,478,00010,991,0002,478,080
7Mar 16, 2026 23:2621,815745,988,403710,906,0008,998,0002,514,944
8Mar 16, 2026 23:2622,050762,757,144719,658,0007,996,0002,363,392
9Mar 16, 2026 23:2622,102756,781,096716,366,00012,988,0002,273,280