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 23, 2026 18:01Victor MerckléVictor MerckléScore: 2,056Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 23, 2026 18:021,99859,948,596148,801,0001,008,0002,641,920stderr
2Aug 23, 2026 18:022,01160,348,085149,321,0001,031,0002,695,168stderr
3Aug 23, 2026 18:022,01360,398,222148,203,0001,013,0002,695,168stderr
4Aug 23, 2026 18:022,03761,127,510152,483,0001,019,0002,695,168stderr
5Aug 23, 2026 18:022,05661,680,581153,809,0002,019,0002,641,920stderr
6Aug 23, 2026 18:022,05661,687,767154,107,0001,017,0002,695,168stderr
7Aug 23, 2026 18:022,07962,386,967153,346,0001,016,0002,641,920stderr
8Aug 23, 2026 18:022,11463,421,494158,519,0002,021,0002,695,168stderr
9Aug 23, 2026 18:022,13063,911,968155,015,0001,026,0002,695,168stderr