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 31, 2026 17:15olliecrowolliecrowScore: 21,235Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 31, 2026 17:1521,023722,767,392679,780,00013,995,0002,301,952
2Jan 31, 2026 17:1521,097718,425,965682,223,00013,984,0002,301,952
3Jan 31, 2026 17:1521,133728,879,534683,387,00013,987,0002,478,080
4Jan 31, 2026 17:1521,192727,235,901684,353,00014,985,0002,293,760
5Jan 31, 2026 17:1521,235730,339,291691,769,0008,997,0002,371,584
6Jan 31, 2026 17:1521,237730,859,788687,821,00012,996,0002,297,856
7Jan 31, 2026 17:1521,341731,710,898689,262,00014,983,0002,281,472
8Jan 31, 2026 17:1521,431737,127,177692,230,00014,983,0002,465,792
9Jan 31, 2026 17:1521,457737,259,593691,092,00016,977,0002,514,944