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 listApr 21, 2026 06:36limanjun99limanjun99Score: 23,692Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 21, 2026 06:3723,469802,596,769749,503,00024,983,0002,387,968
2Apr 21, 2026 06:3723,564800,851,329739,638,00037,981,0002,383,872
3Apr 21, 2026 06:3723,603801,705,890749,909,00028,996,0002,387,968
4Apr 21, 2026 06:3723,622805,659,694745,562,00033,980,0002,379,776
5Apr 21, 2026 06:3723,692810,639,955753,855,00027,994,0002,433,024
6Apr 21, 2026 06:3723,712804,665,646755,539,00026,983,0002,375,680
7Apr 21, 2026 06:3723,719804,490,568754,749,00027,990,0002,392,064
8Apr 21, 2026 06:3723,737807,514,132749,372,00033,971,0002,428,928
9Apr 21, 2026 06:3723,844810,601,689752,876,00033,994,0002,396,160