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 29, 2026 14:23TudyMTudyMScore: 11,213Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 29, 2026 14:2510,625318,751,996862,409,00014,989,0002,830,336
2Apr 29, 2026 14:2510,761322,840,504862,738,00017,014,0002,695,168
3Apr 29, 2026 14:2510,763322,900,837863,990,00016,018,0002,842,624
4Apr 29, 2026 14:2510,888326,656,830885,619,00017,992,0002,695,168
5Apr 29, 2026 14:2511,213336,419,430917,118,00016,983,0002,850,816
6Apr 29, 2026 14:2511,312339,368,880915,747,00018,994,0002,871,296
7Apr 29, 2026 14:2511,363340,899,779919,288,00014,988,0002,863,104
8Apr 29, 2026 14:2511,383341,496,271917,936,00016,980,0002,940,928
9Apr 29, 2026 14:2511,484344,549,294918,017,00016,981,0002,797,568