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 listMar 20, 2026 04:06olliecrowolliecrowScore: 7,260Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 20, 2026 04:066,836205,076,646509,449,00011,009,0002,703,360
2Mar 20, 2026 04:067,087212,595,683509,014,00011,976,0002,375,680
3Mar 20, 2026 04:067,187215,617,799517,152,00010,960,0002,392,064
4Mar 20, 2026 04:067,207216,206,920511,383,00013,009,0002,396,160
5Mar 20, 2026 04:067,260217,803,947515,921,00011,998,0002,379,776
6Mar 20, 2026 04:067,277218,300,559509,184,0009,984,0002,363,392
7Mar 20, 2026 04:067,279218,359,750511,379,0009,968,0002,404,352
8Mar 20, 2026 04:067,382221,449,367511,800,00013,020,0002,400,256
9Mar 20, 2026 04:067,530225,908,875512,816,00013,994,0002,641,920