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 3, 2026 22:45olliecrowolliecrowScore: 12,930Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 3, 2026 22:4512,591377,719,691925,226,00022,005,0002,994,176
2Mar 3, 2026 22:4512,748382,447,561931,086,00021,978,0002,850,816
3Mar 3, 2026 22:4512,854385,631,640947,823,00021,972,0002,846,720
4Mar 3, 2026 22:4512,923387,699,274931,787,00021,017,0002,994,176
5Mar 3, 2026 22:4512,930387,901,591938,854,00020,996,0003,026,944
6Mar 3, 2026 22:4512,964388,923,488933,382,00020,986,0002,969,600
7Mar 3, 2026 22:4513,003390,099,647936,541,00021,989,0002,727,936
8Mar 3, 2026 22:4513,083392,479,560947,252,00020,983,0003,002,368
9Mar 3, 2026 22:4513,098392,940,116947,114,00021,002,0002,871,296