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 30, 2026 04:27Charles CabergsCharles CabergsScore: 12,132Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 30, 2026 04:2811,902357,085,1011,005,846,00010,998,0002,547,712
2Apr 30, 2026 04:2812,068362,048,5911,010,910,00010,988,0002,531,328
3Apr 30, 2026 04:2812,076362,289,4761,024,321,0008,985,0002,551,808
4Apr 30, 2026 04:2812,115363,477,1301,015,747,00010,975,0002,519,040
5Apr 30, 2026 04:2812,132363,980,0871,017,267,00014,989,0002,514,944
6Apr 30, 2026 04:2812,133364,004,2151,015,373,00011,004,0002,654,208
7Apr 30, 2026 04:2812,198365,960,2121,022,452,0006,982,0002,555,904
8Apr 30, 2026 04:2812,361370,836,8131,035,719,0007,997,0002,514,944
9Apr 30, 2026 04:2812,378371,363,4991,035,879,0006,992,0002,555,904