Unique strings v2 Sergey Svistunov

Same problem as Unique strings, but with 3 CPUs available and scoring based on wall time instead of CPU time.

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 listJun 26, 2026 16:49Shikhar SoniShikhar SoniScore: 46,831Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 26, 2026 16:5046,6931,400,808,6231,195,528,000195,187,0002,117,632
2Jun 26, 2026 16:5046,7341,402,023,7311,195,854,000196,000,0002,117,632
3Jun 26, 2026 16:5046,7941,403,831,5701,196,722,000197,022,0002,117,632
4Jun 26, 2026 16:5046,8221,404,678,5151,196,031,000198,303,0002,117,632
5Jun 26, 2026 16:5046,8311,404,946,0241,196,319,000198,560,0002,117,632
6Jun 26, 2026 16:5046,8331,405,005,1331,197,314,000197,636,0002,117,632
7Jun 26, 2026 16:5046,8551,405,676,8611,200,508,000195,136,0002,117,632
8Jun 26, 2026 16:5046,9101,407,307,8801,197,446,000199,782,0002,117,632
9Jun 26, 2026 16:5047,0221,410,666,1321,198,186,000202,365,0002,117,632