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 06:45olliecrowolliecrowScore: 7,510Success
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 06:467,405222,163,998520,813,00025,990,0002,424,832
2Apr 30, 2026 06:467,453223,596,544537,633,00025,029,0002,875,392
3Apr 30, 2026 06:467,488224,668,754517,130,00029,063,0002,908,160
4Apr 30, 2026 06:467,495224,860,329517,368,00027,019,0002,686,976
5Apr 30, 2026 06:467,510225,315,992517,739,00025,986,0002,904,064
6Apr 30, 2026 06:467,557226,727,023516,352,00028,963,0002,863,104
7Apr 30, 2026 06:467,580227,404,878533,600,00026,127,0002,736,128
8Apr 30, 2026 06:467,592227,783,666520,304,00026,015,0002,965,504
9Apr 30, 2026 06:467,605228,165,767524,706,00028,037,0002,863,104