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 12:42Charles CabergsCharles CabergsScore: 12,332Success
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 12:4312,135364,060,5461,025,587,00014,979,0002,924,544
2Apr 27, 2026 12:4312,182365,482,4141,019,808,00016,963,0002,924,544
3Apr 27, 2026 12:4312,219366,583,6611,025,041,00010,989,0002,973,696
4Apr 27, 2026 12:4312,235367,052,6381,028,048,00014,971,0003,055,616
5Apr 27, 2026 12:4312,332369,965,9961,024,466,00015,976,0002,928,640
6Apr 27, 2026 12:4312,526375,792,2361,042,904,00019,940,0002,801,664
7Apr 27, 2026 12:4312,527375,819,8431,044,807,00013,970,0002,973,696
8Apr 27, 2026 12:4312,583377,519,9711,048,077,00015,970,0002,826,240
9Apr 27, 2026 12:4312,631378,933,0521,048,336,00016,956,0002,654,208