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 23, 2026 05:12Charles CabergsCharles CabergsScore: 16,688Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 23, 2026 05:1316,243487,310,5861,383,829,00013,978,0002,957,312
2Apr 23, 2026 05:1316,273488,209,7331,381,629,00021,962,0002,801,664
3Apr 23, 2026 05:1316,311489,344,9571,386,515,00010,988,0002,990,080
4Apr 23, 2026 05:1316,541496,257,0971,415,719,00018,956,0002,945,024
5Apr 23, 2026 05:1316,688500,669,4901,432,967,00014,968,0002,560,000
6Apr 23, 2026 05:1316,737502,113,6171,422,687,00015,974,0002,899,968
7Apr 23, 2026 05:1316,756502,692,9161,423,560,00015,972,0002,351,104
8Apr 23, 2026 05:1316,776503,298,6821,427,562,00010,981,0002,719,744
9Apr 23, 2026 05:1316,956508,689,1771,431,244,00014,960,0002,875,392