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 27, 2026 13:48Victor MerckléVictor MerckléScore: 26,922Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 27, 2026 13:4926,679800,379,476753,763,00029,990,0002,768,896
2Apr 27, 2026 13:4926,698800,956,344751,298,00031,012,0002,338,816
3Apr 27, 2026 13:4926,716801,489,846754,936,00028,997,0002,465,792
4Apr 27, 2026 13:4926,799803,987,751755,541,00031,980,0002,551,808
5Apr 27, 2026 13:4926,922807,672,734754,382,00033,972,0002,306,048
6Apr 27, 2026 13:4926,932807,971,568755,603,00032,982,0002,551,808
7Apr 27, 2026 13:4927,193815,813,913766,661,00032,985,0002,539,520
8Apr 27, 2026 13:4927,278818,361,661764,668,00033,985,0002,772,992
9Apr 27, 2026 13:4927,588827,661,100768,442,00037,972,0002,551,808