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 21:59TudyMTudyMScore: 15,816Success
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 22:0615,440463,216,3161,233,805,00036,964,0002,564,096
2Apr 27, 2026 22:0615,468464,056,1011,239,158,00028,980,0002,400,256
3Apr 27, 2026 22:0615,576467,284,1341,237,258,00032,953,0002,535,424
4Apr 27, 2026 22:0615,720471,623,0021,235,773,00031,994,0002,789,376
5Apr 27, 2026 22:0615,816474,498,9051,274,801,00029,948,0002,887,680
6Apr 27, 2026 22:0615,856475,681,5521,274,992,00029,952,0002,465,792
7Apr 27, 2026 22:0615,941478,244,5181,264,611,00038,926,0002,605,056
8Apr 27, 2026 22:0615,961478,850,4001,271,887,00028,951,0002,772,992
9Apr 27, 2026 22:0616,143484,298,5791,275,508,00029,941,0002,314,240