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 listAug 23, 2026 19:57Victor MerckléVictor MerckléScore: 4,558Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 23, 2026 19:584,492157,321,955144,405,0003,862,0002,138,112stderr
2Aug 23, 2026 19:584,528158,505,681145,577,0003,870,0002,138,112stderr
3Aug 23, 2026 19:584,536158,641,040145,859,0003,851,0002,138,112stderr
4Aug 23, 2026 19:584,539158,186,623145,950,0003,839,0002,138,112stderr
5Aug 23, 2026 19:584,558159,390,706146,551,0003,864,0002,138,112stderr
6Aug 23, 2026 19:584,620161,486,376148,634,0003,831,0002,138,112stderr
7Aug 23, 2026 19:584,641161,613,014149,444,0003,739,0002,138,112stderr
8Aug 23, 2026 19:584,798176,311,796154,462,0003,874,0002,138,112stderr
9Aug 23, 2026 19:584,799175,482,404154,481,0003,895,0002,138,112stderr