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 4, 2026 03:48olliecrowolliecrowScore: 10,116Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 4, 2026 03:489,957298,706,504777,622,0009,982,0002,600,960
2Mar 4, 2026 03:489,961298,831,934771,259,00010,989,0002,383,872
3Mar 4, 2026 03:4810,006300,185,450771,369,0009,991,0002,371,584
4Mar 4, 2026 03:4810,040301,206,478768,898,0009,985,0002,387,968
5Mar 4, 2026 03:4810,116303,468,182769,291,00011,004,0002,568,192
6Mar 4, 2026 03:4810,159304,773,464768,546,00011,007,0002,379,776
7Mar 4, 2026 03:4810,281308,429,553802,125,0009,976,0002,379,776
8Mar 4, 2026 03:4810,323309,700,301802,921,0009,999,0002,383,872
9Mar 4, 2026 03:4810,556316,666,049801,511,0008,983,0002,396,160