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 15, 2026 21:44Victor MerckléVictor MerckléScore: 4,608Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 15, 2026 21:454,562136,866,500373,299,0005,612,0002,654,208stderr
2Aug 15, 2026 21:454,575137,270,858373,690,0005,796,0002,650,112stderr
3Aug 15, 2026 21:454,576137,291,680376,472,0005,556,0002,650,112stderr
4Aug 15, 2026 21:454,592137,782,174377,366,0005,619,0002,650,112stderr
5Aug 15, 2026 21:454,608138,264,911378,112,0005,669,0002,654,208stderr
6Aug 15, 2026 21:454,619138,585,951378,632,0005,658,0002,654,208stderr
7Aug 15, 2026 21:454,629138,888,284377,272,0005,900,0002,654,208stderr
8Aug 15, 2026 21:454,635139,073,674377,877,0005,513,0002,650,112stderr
9Aug 15, 2026 21:454,649139,498,186378,797,0005,526,0002,658,304stderr