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 13:47TudyMTudyMScore: 10,773Success
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 13:5510,582317,473,365858,861,00017,997,0002,785,280
2Apr 29, 2026 13:5510,642319,264,206859,533,00018,989,0002,732,032
3Apr 29, 2026 13:5510,694320,828,628861,661,00018,013,0002,736,128
4Apr 29, 2026 13:5510,743322,304,709860,418,00019,009,0002,768,896
5Apr 29, 2026 13:5510,773323,193,670874,143,00017,002,0002,793,472
6Apr 29, 2026 13:5510,786323,584,673865,391,00017,007,0002,617,344
7Apr 29, 2026 13:5510,797323,926,161869,573,00015,992,0002,830,336
8Apr 29, 2026 13:5510,908327,263,057864,459,00015,990,0002,834,432
9Apr 29, 2026 13:5511,189335,682,021864,049,00012,985,0002,678,784