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 2, 2026 13:58Victor MerckléVictor MerckléScore: 4,838Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 2, 2026 13:594,805144,175,937397,290,0005,650,0002,650,112stderr
2Aug 2, 2026 13:594,807144,235,730397,432,0005,439,0002,650,112stderr
3Aug 2, 2026 13:594,813144,409,408397,496,0005,601,0002,650,112stderr
4Aug 2, 2026 13:594,819144,573,303396,919,0005,526,0002,650,112stderr
5Aug 2, 2026 13:594,838145,148,215398,661,0005,629,0002,654,208stderr
6Aug 2, 2026 13:594,843145,306,914400,384,0005,548,0002,650,112stderr
7Aug 2, 2026 13:594,863145,900,995400,036,0005,586,0002,650,112stderr
8Aug 2, 2026 13:594,877146,330,389400,996,0005,520,0002,416,640stderr
9Aug 2, 2026 13:594,914147,422,689403,207,0004,649,0002,654,208stderr