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 23, 2026 02:25olliecrowolliecrowScore: 6,102Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 23, 2026 02:266,008180,254,411450,516,0008,970,0002,670,592
2Apr 23, 2026 02:266,029180,872,378448,180,0009,003,0002,670,592
3Apr 23, 2026 02:266,030180,909,475449,382,0008,967,0002,596,864
4Apr 23, 2026 02:266,100183,010,182445,511,00010,963,0002,945,024
5Apr 23, 2026 02:266,102183,087,081448,433,0008,968,0002,723,840
6Apr 23, 2026 02:266,155184,676,628447,377,00010,008,0002,605,056
7Apr 23, 2026 02:266,180185,413,812447,848,0009,996,0002,666,496
8Apr 23, 2026 02:266,192185,776,579451,383,0008,967,0002,441,216
9Apr 23, 2026 02:266,225186,778,666449,257,0008,965,0002,686,976