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 22:53TudyMTudyMScore: 11,248Success
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 23:0311,063331,895,582900,694,00031,989,0002,838,528
2Apr 27, 2026 23:0311,109333,271,148901,908,00028,997,0002,510,848
3Apr 27, 2026 23:0311,135334,056,915904,803,00026,023,0002,453,504
4Apr 27, 2026 23:0311,226336,800,208907,459,00027,013,0002,646,016
5Apr 27, 2026 23:0311,248337,455,336896,874,00033,995,0002,580,480
6Apr 27, 2026 23:0311,381341,445,455899,507,00028,015,0002,379,776
7Apr 27, 2026 23:0311,634349,022,881930,070,00035,964,0002,588,672
8Apr 27, 2026 23:0311,673350,192,078935,089,00029,970,0002,396,160
9Apr 27, 2026 23:0311,902357,067,901932,715,00025,992,0002,564,096