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 listSep 12, 2026 05:42Haha ExpertHaha ExpertScore: 63,987Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 12, 2026 05:4363,8041,914,126,7311,815,488,00086,747,0002,138,112
2Sep 12, 2026 05:4363,8571,915,710,4961,819,972,00083,839,0002,117,632
3Sep 12, 2026 05:4363,8651,915,951,1221,820,196,00083,737,0002,117,632
4Sep 12, 2026 05:4363,9071,917,212,9731,819,570,00085,723,0002,150,400
5Sep 12, 2026 05:4363,9871,919,631,8091,821,158,00086,593,0002,138,112
6Sep 12, 2026 05:4364,0001,920,015,3251,820,782,00086,589,0002,138,112
7Sep 12, 2026 05:4364,0331,921,000,1331,822,796,00085,572,0002,117,632
8Sep 12, 2026 05:4364,1661,924,996,2721,826,370,00086,650,0002,150,400
9Sep 12, 2026 05:4364,5381,936,158,8331,836,937,00086,593,0002,150,400