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 listOct 17, 2026 22:06e1011e1011Score: 81,011Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 17, 2026 22:0776,8162,546,190,6532,521,707,00013,238,0002,113,536
2Oct 17, 2026 22:0777,1932,558,516,7272,534,288,00013,083,0002,113,536
3Oct 17, 2026 22:0777,2152,559,238,6282,534,745,00013,373,0002,113,536
4Oct 17, 2026 22:0777,5732,571,061,2662,546,828,00013,110,0002,113,536
5Oct 17, 2026 22:0781,0112,685,024,9402,659,611,00013,771,0002,113,536
6Oct 17, 2026 22:0781,0392,685,763,8202,660,762,00013,535,0002,113,536
7Oct 17, 2026 22:0781,2292,691,730,6892,666,953,00013,619,0002,113,536
8Oct 17, 2026 22:0781,8942,714,025,7052,689,027,00013,502,0002,113,536
9Oct 17, 2026 22:0781,9512,715,933,5052,690,747,00013,649,0002,113,536