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 listOct 19, 2026 02:30highload-churnerhighload-churnerScore: 1,503Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 19, 2026 02:321,49044,714,993104,225,0000368,640stderr
2Oct 19, 2026 02:321,49344,804,583103,160,0001,014,000368,640stderr
3Oct 19, 2026 02:321,49944,995,453103,674,0002,136,000360,448stderr
4Oct 19, 2026 02:321,50245,078,108103,482,0002,125,000360,448stderr
5Oct 19, 2026 02:321,50345,096,926103,770,0002,144,000360,448stderr
6Oct 19, 2026 02:321,50545,163,669105,879,0000360,448stderr
7Oct 19, 2026 02:321,50645,201,013106,087,0000356,352stderr
8Oct 19, 2026 02:321,51845,542,053106,426,0000356,352stderr
9Oct 19, 2026 02:321,53045,904,803106,259,0001,022,000364,544stderr