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 listJul 23, 2026 21:03boop34boop34Score: 9,705Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 23, 2026 21:049,659328,590,259313,842,0004,937,0002,113,536
2Jul 23, 2026 21:049,666328,830,935313,990,0005,015,0002,113,536
3Jul 23, 2026 21:049,676329,160,064314,181,0005,129,0002,113,536
4Jul 23, 2026 21:049,688329,468,865314,562,0005,171,0002,113,536
5Jul 23, 2026 21:049,705330,065,442315,202,0005,080,0002,113,536
6Jul 23, 2026 21:049,706330,190,854315,056,0005,255,0002,113,536
7Jul 23, 2026 21:049,719330,550,575315,599,0005,153,0002,113,536
8Jul 23, 2026 21:049,731330,993,265315,829,0005,320,0002,113,536
9Jul 23, 2026 21:049,750331,603,332316,833,0004,921,0002,113,536