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 listJan 11, 2026 14:47Josu San MartinJosu San MartinScore: 2,967Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 11, 2026 14:472,80484,122,727161,770,0002,995,0002,629,632
2Jan 11, 2026 14:472,89086,713,505162,201,0002,985,0002,367,488
3Jan 11, 2026 14:472,89986,978,450160,506,0002,990,0002,605,056
4Jan 11, 2026 14:472,95988,763,781163,487,0002,005,0002,613,248
5Jan 11, 2026 14:472,96789,014,271161,939,0001,999,0002,367,488
6Jan 11, 2026 14:472,98589,546,917160,680,0002,008,0002,359,296
7Jan 11, 2026 14:473,03791,110,720160,106,0003,001,0002,342,912
8Jan 11, 2026 14:473,04291,259,731160,860,0002,997,0002,359,296
9Jan 11, 2026 14:473,10093,010,258164,111,0001,989,0002,605,056