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 18:12Victor MerckléVictor MerckléScore: 6,997Success
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 18:136,780203,414,781490,590,00046,055,0002,703,360
2Apr 28, 2026 18:136,874206,233,166480,344,00041,942,0002,949,120
3Apr 28, 2026 18:136,898206,950,739498,875,00043,901,0002,625,536
4Apr 28, 2026 18:136,941208,252,338490,174,00048,017,0002,809,856
5Apr 28, 2026 18:136,997209,916,279487,872,00056,100,0002,547,712
6Apr 28, 2026 18:137,082212,483,539488,169,00043,014,0002,801,664
7Apr 28, 2026 18:137,177215,330,563489,772,00044,979,0002,756,608
8Apr 28, 2026 18:137,195215,850,081490,935,00037,070,0002,703,360
9Apr 28, 2026 18:137,220216,610,216484,467,00045,043,0002,699,264