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 31, 2026 13:57Victor MerckléVictor MerckléScore: 5,011Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 31, 2026 13:584,975149,257,008413,756,0003,142,0002,174,976stderr
2Aug 31, 2026 13:584,975149,261,244412,085,0003,083,0002,174,976stderr
3Aug 31, 2026 13:584,983149,506,412414,722,0002,088,0002,174,976stderr
4Aug 31, 2026 13:584,995149,861,215415,079,0003,134,0002,174,976stderr
5Aug 31, 2026 13:585,011150,343,128415,201,0002,103,0002,174,976stderr
6Aug 31, 2026 13:585,014150,442,167415,359,0002,016,0002,174,976stderr
7Aug 31, 2026 13:585,014150,429,294414,232,0002,114,0002,174,976stderr
8Aug 31, 2026 13:585,027150,831,284418,072,0002,117,0002,174,976stderr
9Aug 31, 2026 13:585,032150,969,157416,369,0002,104,0002,174,976stderr