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 22, 2026 23:30Charles CabergsCharles CabergsScore: 16,110Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 22, 2026 23:3115,907477,236,5431,346,864,00019,968,0002,953,216
2Apr 22, 2026 23:3115,919477,596,8111,351,738,00019,981,0002,351,104
3Apr 22, 2026 23:3116,031480,945,2731,355,877,00017,985,0002,785,280
4Apr 22, 2026 23:3116,031480,955,5051,350,867,00015,974,0002,981,888
5Apr 22, 2026 23:3116,110483,310,0031,357,927,00021,982,0002,981,888
6Apr 22, 2026 23:3116,217486,513,3661,368,752,00023,978,0002,928,640
7Apr 22, 2026 23:3116,540496,204,5261,403,751,00016,972,0002,998,272
8Apr 22, 2026 23:3116,550496,505,7761,411,255,0008,982,0002,916,352
9Apr 22, 2026 23:3116,690500,717,1151,409,109,00019,959,0002,949,120