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 listMay 6, 2026 05:21olliecrowolliecrowScore: 55,841Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 6, 2026 05:2255,7421,672,274,9281,628,448,00027,537,0002,531,328
2May 6, 2026 05:2255,7821,673,476,5151,629,253,00028,055,0002,535,424
3May 6, 2026 05:2255,8141,674,430,6501,629,013,00027,468,0002,543,616
4May 6, 2026 05:2255,8281,674,852,1671,629,389,00028,634,0002,543,616
5May 6, 2026 05:2255,8411,675,234,0831,629,142,00027,047,0002,580,480
6May 6, 2026 05:2255,8991,676,971,1401,629,102,00027,706,0002,547,712
7May 6, 2026 05:2255,9051,677,155,4131,628,553,00028,727,0002,539,520
8May 6, 2026 05:2255,9371,678,131,1391,631,241,00028,206,0002,539,520
9May 6, 2026 05:2255,9671,679,031,2151,629,569,00027,990,0002,539,520