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 28, 2026 12:08Charles CabergsCharles CabergsScore: 12,282Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 28, 2026 12:0912,182365,478,8451,026,207,00015,987,0002,969,600
2Apr 28, 2026 12:0912,182365,470,5931,023,897,00013,984,0002,838,528
3Apr 28, 2026 12:0912,191365,745,6491,027,543,00015,977,0002,924,544
4Apr 28, 2026 12:0912,232366,983,7401,022,057,00014,971,0002,940,928
5Apr 28, 2026 12:0912,282368,480,6671,021,952,00015,983,0002,932,736
6Apr 28, 2026 12:0912,318369,563,6281,029,607,00014,979,0002,973,696
7Apr 28, 2026 12:0912,350370,517,0581,026,260,00013,976,0002,940,928
8Apr 28, 2026 12:0912,423372,704,4431,026,442,00013,978,0002,924,544
9Apr 28, 2026 12:0912,663379,904,8921,054,105,00012,964,0002,932,736