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 listAug 14, 2026 20:39Tomislav TunkovicTomislav TunkovicScore: 2,952Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 14, 2026 20:452,89486,828,059220,005,00013,036,0002,166,784stderr
2Aug 14, 2026 20:452,89986,996,236221,009,00012,733,0002,166,784stderr
3Aug 14, 2026 20:452,93588,074,360221,681,00012,776,0002,166,784stderr
4Aug 14, 2026 20:452,94288,269,282221,752,00012,784,0002,166,784stderr
5Aug 14, 2026 20:452,95288,561,648223,151,00012,746,0002,166,784stderr
6Aug 14, 2026 20:452,95488,631,494223,512,00012,738,0002,166,784stderr
7Aug 14, 2026 20:452,95788,711,351223,340,00012,646,0002,166,784stderr
8Aug 14, 2026 20:452,96088,809,916225,465,00011,255,0002,166,784stderr
9Aug 14, 2026 20:452,98089,417,129225,322,00013,142,0002,166,784stderr