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 16, 2026 03:02Victor MerckléVictor MerckléScore: 4,187Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 16, 2026 03:064,143124,297,841340,221,0003,037,0002,314,240stderr
2Aug 16, 2026 03:064,144124,330,031339,315,0003,105,0002,527,232stderr
3Aug 16, 2026 03:064,174125,236,946342,798,0003,038,0002,330,624stderr
4Aug 16, 2026 03:064,186125,595,843341,867,0003,082,0002,347,008stderr
5Aug 16, 2026 03:064,187125,623,059341,937,0003,121,0002,387,968stderr
6Aug 16, 2026 03:064,261127,841,106346,114,0003,103,0002,260,992stderr
7Aug 16, 2026 03:064,354130,648,969358,618,0003,008,0002,506,752stderr
8Aug 16, 2026 03:064,360130,808,954356,917,0003,057,0002,383,872stderr
9Aug 16, 2026 03:064,409132,296,748362,143,0004,098,0002,260,992stderr