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 listApr 27, 2026 22:46TudyMTudyMScore: 11,133Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 27, 2026 22:5510,578317,369,919863,438,00017,008,0002,625,536
2Apr 27, 2026 22:5510,579317,390,193861,755,00017,994,0002,924,544
3Apr 27, 2026 22:5510,655319,673,589862,048,00013,000,0002,801,664
4Apr 27, 2026 22:5510,734322,032,482864,702,00016,994,0002,797,568
5Apr 27, 2026 22:5511,133334,016,444917,263,00015,004,0002,461,696
6Apr 27, 2026 22:5511,231336,931,650915,314,00016,005,0002,445,312
7Apr 27, 2026 22:5511,243337,291,541919,847,00013,997,0002,732,032
8Apr 27, 2026 22:5511,252337,581,057918,491,00013,977,0002,793,472
9Apr 27, 2026 22:5511,315339,457,460917,147,00013,987,0002,588,672