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 26, 2026 05:43Charles CabergsCharles CabergsScore: 15,851Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 26, 2026 05:4415,534466,040,8541,316,243,00013,981,0002,781,184
2Apr 26, 2026 05:4415,588467,646,1121,318,999,00011,990,0002,793,472
3Apr 26, 2026 05:4415,763472,916,9871,333,070,00013,990,0002,879,488
4Apr 26, 2026 05:4415,780473,419,7861,346,691,00013,976,0002,945,024
5Apr 26, 2026 05:4415,851475,535,0581,346,728,00013,976,0002,822,144
6Apr 26, 2026 05:4415,879476,397,0841,342,127,00017,961,0002,998,272
7Apr 26, 2026 05:4415,891476,752,5901,359,180,00014,979,0002,514,944
8Apr 26, 2026 05:4415,934478,028,0981,359,819,00015,974,0002,539,520
9Apr 26, 2026 05:4416,005480,155,0461,356,701,00015,984,0002,957,312